{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:26:28Z","timestamp":1725557188836},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130359"},{"type":"electronic","value":"9783642130366"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13036-6_13","type":"book-chapter","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:36:09Z","timestamp":1276000569000},"page":"163-176","source":"Crossref","is-referenced-by-count":16,"title":["Secretary Problems via Linear Programming"],"prefix":"10.1007","author":[{"given":"Niv","family":"Buchbinder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamal","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohit","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Meyerson, A.: Reducing Truth-Telling Online Mechanisms to Online Optimization. In: Proceedings of ACM Symposium on Theory of Computing, pp. 503\u2013510 (2003)","DOI":"10.1145\/780542.780616"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-74208-1_2","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Babaioff","year":"2007","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: A Knapsack Secretary Problem with Applications. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 16\u201328. Springer, Heidelberg (2007)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1399589.1399596","volume":"7","author":"M. Babaioff","year":"2008","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online Auctions and Generalized Secretary Problems. SIGecom Exchange\u00a07, 1\u201311 (2008)","journal-title":"SIGecom Exchange"},{"key":"13_CR4","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, Secretary Problems, and Online Mechanisms. In: Proceedings 18th ACM-SIAM Symposium on Discrete Algorithms (2007)"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/1.9781611973068.135","volume-title":"SODA \u201909: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms","author":"M. Babaioff","year":"2009","unstructured":"Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: weights and discounts. In: SODA \u201909: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, pp. 1245\u20131254. Society for Industrial and Applied Mathematics, Philadelphia (2009)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Singh, M., Jain, K.: Incentives in Online Auctions and Secretary Problems via Linear Programming (2009) (manuscript)","DOI":"10.1007\/978-3-642-17572-5_9"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-75520-3_24","volume-title":"Algorithms \u2013 ESA 2007","author":"N. Buchbinder","year":"2007","unstructured":"Buchbinder, N., Jain, K., Naor, J(S.): Online primal-dual algorithms for maximizing ad-auctions revenue. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 253\u2013264. Springer, Heidelberg (2007)"},{"key":"13_CR8","unstructured":"Dynkin, E.B.: The Optimum Choice of the Instant for Stopping a Markov Process. Sov. Math. Dokl.\u00a04 (1963)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1214\/ss\/1177012493","volume":"4","author":"T.S. Ferguson","year":"1989","unstructured":"Ferguson, T.S.: Who Solved the Secretary Problem? Statist. Sci.\u00a04, 282\u2013289 (1989)","journal-title":"Statist. Sci."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.2307\/1402748","volume":"51","author":"P.R. Freeman","year":"1983","unstructured":"Freeman, P.R.: The Secretary Problem and its Extensions: A Review. International Statistical Review\u00a051, 189\u2013206 (1983)","journal-title":"International Statistical Review"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Gardner, M.: Mathematical Games. Scientific American, 150\u2013153 (1960)","DOI":"10.1038\/scientificamerican0160-150"},{"key":"13_CR12","unstructured":"Goemans, M., Kleinberg, J.: An improved approximation ratio for the minimum latency problem. In: SODA \u201996: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, pp. 152\u2013158 (1996)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Parkes, D.C.: Adaptive Limited-Supply Online Auctions. In: Proceedings of the 5th ACM Conference on Electronic Commerce (2004)","DOI":"10.1145\/988772.988784"},{"issue":"6","key":"13_CR14","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K. Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing lp. J. ACM\u00a050(6), 795\u2013824 (2003)","journal-title":"J. ACM"},{"key":"13_CR15","unstructured":"Kleinberg, R.: A Multiple-Choice Secretary Algorithm with Applications to Online Auctions. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete algorithms (2005)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-642-02930-1_42","volume-title":"Automata, Languages and Programming","author":"N. Korula","year":"2009","unstructured":"Korula, N., P\u00e1l, M.: Algorithms for secretary problems on graphs and hypergraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 508\u2013520. Springer, Heidelberg (2009)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Lavi, R., Nisan, N.: Competitive Analysis of Incentive Compatible On-line Auctions. In: Proceedings of 2nd ACM Conf. on Electronic Commerce, pp. 233\u2013241 (2000)","DOI":"10.1145\/352871.352897"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2307\/2985407","volume":"10","author":"D.V. Lindley","year":"1961","unstructured":"Lindley, D.V.: Dynamic Programming and Decision Theory. Applied Statistics\u00a010, 39\u201351 (1961)","journal-title":"Applied Statistics"},{"issue":"5","key":"13_CR19","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/1284320.1284321","volume":"54","author":"A. Mehta","year":"2007","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM\u00a054(5), 22 (2007)","journal-title":"J. ACM"},{"key":"13_CR20","unstructured":"Samuels, S.M.: Secretary Problems. In: Handbook of Sequential Analysis, vol.\u00a0118, pp. 381\u2013405 (1991)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13036-6_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:00:19Z","timestamp":1606186819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13036-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130359","9783642130366"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13036-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}