{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T16:17:34Z","timestamp":1769876254969,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319996592","type":"print"},{"value":"9783319996608","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99660-8_18","type":"book-chapter","created":{"date-parts":[[2018,8,26]],"date-time":"2018-08-26T18:19:21Z","timestamp":1535307561000},"page":"201-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Online Trading as a Secretary Problem"],"prefix":"10.1007","author":[{"given":"Elias","family":"Koutsoupias","sequence":"first","affiliation":[]},{"given":"Philip","family":"Lazos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"key":"18_CR1","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201907, pp. 434\u2013443. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2007)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-662-54110-4_28","volume-title":"Web and Internet Economics","author":"L Blumrosen","year":"2016","unstructured":"Blumrosen, L., Mizrahi, Y.: Approximating gains-from-trade in bilateral trading. In: Cai, Y., Vetta, A. (eds.) WINE 2016. LNCS, vol. 10123, pp. 400\u2013413. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-54110-4_28"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Brustle, J., Cai, Y., Wu, F., Zhao, M.: Approximating gains from trade in two-sided markets via simple mechanisms. In: Proceedings of the 2017 ACM Conference on Economics and Computation, pp. 589\u2013590. ACM (2017)","DOI":"10.1145\/3033274.3085148"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Malec, D.L., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 311\u2013320. ACM (2010)","DOI":"10.1145\/1806689.1806733"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-71924-5_11","volume-title":"Web and Internet Economics","author":"R Colini-Baldeschi","year":"2017","unstructured":"Colini-Baldeschi, R., Goldberg, P., de Keijzer, B., Leonardi, S., Turchetta, S.: Fixed price approximability of the optimal gain from trade. In: Devanur, N.R., Lu, P. (eds.) WINE 2017. LNCS, vol. 10660, pp. 146\u2013160. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71924-5_11"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00453-010-9457-2","volume":"62","author":"NB Dimitrov","year":"2012","unstructured":"Dimitrov, N.B., Plaxton, C.G.: Competitive weighted matching in transversal matroids. Algorithmica 62(1), 333\u2013348 (2012)","journal-title":"Algorithmica"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1145\/2491533.2491557","volume":"44","author":"M Dinitz","year":"2013","unstructured":"Dinitz, M.: Recent advances on the matroid secretary problem. SIGACT News 44(2), 126\u2013142 (2013)","journal-title":"SIGACT News"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-66700-3_3","volume-title":"Algorithmic Game Theory","author":"A Eden","year":"2017","unstructured":"Eden, A., Feldman, M., Vardi, A.: Online random sampling for budgeted settings. In: Bil\u00f2, V., Flammini, M. (eds.) SAGT 2017. LNCS, vol. 10504, pp. 29\u201340. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66700-3_3"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, M., Gravin, N., Lucier, B.: Combinatorial auctions via posted prices. In: Proceedings of the Twenty-sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201915, pp. 123\u2013135. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2015)","DOI":"10.1137\/1.9781611973730.10"},{"key":"18_CR10","unstructured":"Giannakopoulos, Y., Koutsoupias, E., Lazos, P.: Online market intermediation. In: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, ICALP \u201917, (2017). Full version in CoRR: abs\/1703.09279"},{"key":"18_CR11","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, pp. 71\u201380. ACM (2004)","DOI":"10.1145\/988772.988784"},{"key":"18_CR12","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Sandholm, T.: Automated online mechanism design and prophet inequalities. In: AAAI, vol. 7, pp. 58\u201365 (2007)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-642-40450-4_50","volume-title":"Algorithms \u2013 ESA 2013","author":"T Kesselheim","year":"2013","unstructured":"Kesselheim, T., Radke, K., T\u00f6nnis, A., V\u00f6cking, B.: An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 589\u2013600. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_50"},{"key":"18_CR14","unstructured":"Robert Kleinberg. A multiple-choice secretary algorithm with applications to online auctions. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201905, pp. 630\u2013631. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2005)"},{"key":"18_CR15","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. 5556, pp. 508\u2013520. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_42"},{"issue":"2","key":"18_CR16","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0022-0531(92)90091-U","volume":"56","author":"PR McAfee","year":"1992","unstructured":"McAfee, P.R.: A dominant strategy double auction. J. Econ. Theory 56(2), 434\u2013450 (1992)","journal-title":"J. Econ. Theory"},{"issue":"1","key":"18_CR17","first-page":"1","volume":"1","author":"PR McAfee","year":"2008","unstructured":"McAfee, P.R.: The gains from trade under fixed price mechanisms. Appl. Econ. Res. Bull. 1(1), 1\u201310 (2008)","journal-title":"Appl. Econ. Res. Bull."},{"issue":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0531(83)90048-0","volume":"29","author":"RB Myerson","year":"1983","unstructured":"Myerson, R.B., Satterthwaite, M.A.: Efficient mechanisms for bilateral trading. J. Econ. Theory 29(2), 265\u2013281 (1983)","journal-title":"J. Econ. Theory"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-662-53354-3_21","volume-title":"Algorithmic Game Theory","author":"E Segal-Halevi","year":"2016","unstructured":"Segal-Halevi, E., Hassidim, A., Aumann, Y.: SBBA: a strongly-budget-balanced double-auction mechanism. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 260\u2013272. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53354-3_21"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99660-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:41:37Z","timestamp":1709833297000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99660-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319996592","9783319996608"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99660-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"27 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aims.sjtu.edu.cn\/SAGT_2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}