{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:02:57Z","timestamp":1725897777441},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315930"},{"type":"electronic","value":"9783642315947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_7","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T21:20:21Z","timestamp":1340400021000},"page":"75-87","source":"Crossref","is-referenced-by-count":10,"title":["Secretary Problems with Convex Costs"],"prefix":"10.1007","author":[{"given":"Siddharth","family":"Barman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seeun","family":"Umboh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuchi","family":"Chawla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Malec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: weights and discounts. In: SODA 2009 (2009)","DOI":"10.1137\/1.9781611973068.135"},{"key":"7_CR2","unstructured":"Babaioff, M., Hartline, J., Kleinberg, R.: Selling banner ads: Online algorithms with buyback. In: Fourth Workshop on Ad Auctions (2008)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Hartline, J.D., Kleinberg, R.D.: Selling ad campaigns: Online algorithms with cancellations. In: EC 2009 (2009)","DOI":"10.1145\/1566374.1566383"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: A knapsack secretary problem with applications. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 16\u201328 (2007)","DOI":"10.1007\/978-3-540-74208-1_2"},{"key":"7_CR5","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: SODA 2007 (2007)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Barman, S., Umboh, S., Chawla, S., Malec, D.L.: Secretary problems with convex costs. CoRR, abs\/1112.1136 (2011)","DOI":"10.1007\/978-3-642-31594-7_7"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Bateni, M.H., Hajiaghayi, M.T., Zadimoghaddam, M.: Submodular secretary problem and extensions. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 39\u201352 (2010)","DOI":"10.1007\/978-3-642-15369-3_4"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Lachish, O.: Improved competitive ratio for the matroid secretary problem. In: SODA 2012 (2012)","DOI":"10.1137\/1.9781611973099.135"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Malec, D.L., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing. In: STOC 2010 (2010)","DOI":"10.1145\/1807406.1807428"},{"key":"7_CR10","unstructured":"Dean, B.C., Goemans, M.X., Vondr\u00e1k, J.: Adaptivity and approximation for stochastic packing problems. In: SODA 2005 (2005)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-540-70575-8_33","volume-title":"Automata, Languages and Programming","author":"N.B. Dimitrov","year":"2008","unstructured":"Dimitrov, N.B., Plaxton, C.G.: Competitive Weighted Matching in Transversal Matroids. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 397\u2013408. Springer, Heidelberg (2008)"},{"key":"7_CR12","unstructured":"Dynkin, E.B.: The optimum choice of the instant for stopping a Markov process. Soviet Math. Dokl\u00a04(627-629) (1963)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1007\/11600930_89","volume-title":"Internet and Network Economics","author":"U. Feige","year":"2005","unstructured":"Feige, U., Flaxman, A.D., Hartline, J.D., Kleinberg, R.D.: On the Competitive Ratio of the Random Sampling Auction. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 878\u2013886. Springer, Heidelberg (2005)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Feldman, M., Naor, J., Schwartz, R.: Improved competitive ratios for submodular secretary problems. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 218\u2013229 (2011)","DOI":"10.1007\/978-3-642-22935-0_19"},{"issue":"3","key":"7_CR15","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1214\/ss\/1177012493","volume":"4","author":"T. Ferguson","year":"1989","unstructured":"Ferguson, T.: Who solved the secretary problem. Statist. Sci.\u00a04(3), 282\u2013289 (1989)","journal-title":"Statist. Sci."},{"issue":"2","key":"7_CR16","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(2), 189\u2013206 (1983)","journal-title":"International Statistical Review"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Gupta, A., Roth, A., Schoenebeck, G., Talwar, K.: Constrained non-monotone submodular maximization: Offline and secretary algorithms. Internet and Network Economics, 246\u2013257 (2010)","DOI":"10.1007\/978-3-642-17572-5_20"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Parkes, D.C.: Adaptive limited-supply online auctions. In: EC 2004 (2004)","DOI":"10.1145\/988772.988784"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-4149(87)90029-9","volume":"24","author":"D.P. Kennedy","year":"1987","unstructured":"Kennedy, D.P.: Prophet-type inequalities for multi-choice optimal stopping. Stochastic Processes and their Applications\u00a024(1), 77\u201388 (1987)","journal-title":"Stochastic Processes and their Applications"},{"key":"7_CR20","unstructured":"Kleinberg, R.: A multiple-choice secretary algorithm with applications to online auctions. In: SODA 2005 (2005)"},{"key":"7_CR21","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":"7_CR22","unstructured":"Oxley, J.: Matroid Theory. Oxford University Press (1992)"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Samuel-Cahn, E.: Comparison of threshold stop rules and maximum for independent nonnegative random variables. The Annals of Probability\u00a012 (1984)","DOI":"10.1214\/aop\/1176993150"},{"key":"7_CR24","unstructured":"Samuels, S.: Secretary problems. In: Handbook of Sequential Analysis, pp. 381\u2013405. Marcel Dekker (1991)"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Soto, J.A.: Matroid Secretary Problem in the Random Assignment Model. In: SODA 2011 (2011)","DOI":"10.1137\/1.9781611973082.97"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31594-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:15:15Z","timestamp":1620130515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}