{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:09:28Z","timestamp":1742972968292,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030649456"},{"type":"electronic","value":"9783030649463"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-64946-3_11","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"147-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions"],"prefix":"10.1007","author":[{"given":"Mete \u015eeref","family":"Ahunbay","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Vetta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Ahunbay, M., Lucier, B., Vetta, A.: Two-buyer sequential multiunit auctions with no overbidding. arXiv preprint arXiv:2006.03142 (2020)","DOI":"10.1007\/978-3-030-57980-7_1"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bae, J., Beigman, E., Berry, R., Honig, M.L., Vohra, R.: On the efficiency of sequential auctions for spectrum sharing. In: Proceedings of the International Conference on Game Theory for Networks, pp. 199\u2013205 (2009)","DOI":"10.1109\/GAMENETS.2009.5137402"},{"issue":"7","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/JSAC.2008.080916","volume":"26","author":"J Bae","year":"2008","unstructured":"Bae, J., Beigman, E., Berry, R.A., Honig, M.L., Vohra, R.: Sequential bandwidth and power auctions for distributed spectrum sharing. IEEE J. Sel. Areas Commun. 26(7), 1193\u20131203 (2008)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-38016-7_18","volume-title":"Approximation and Online Algorithms","author":"V Bil\u00f2","year":"2013","unstructured":"Bil\u00f2, V.: A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp. 215\u2013228. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38016-7_18"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-45046-4_14","volume-title":"Web and Internet Economics","author":"M Feldman","year":"2013","unstructured":"Feldman, M., Lucier, B., Syrgkanis, V.: Limits of efficiency in sequential auctions. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 160\u2013173. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45046-4_14"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1006\/game.2000.0802","volume":"36","author":"IL Gale","year":"2001","unstructured":"Gale, I.L., Stegeman, M.: Sequential auctions of endogenously valued objects. Games Econ. Behav. 36(1), 74\u2013103 (2001). https:\/\/doi.org\/10.1006\/game.2000.0802","journal-title":"Games Econ. Behav."},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Kulkarni, J., Mirrokni, V.: Robust price of anarchy bounds via LP and fenchel duality. In: Proceedings of the 2015 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1030\u20131049 (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.70","DOI":"10.1137\/1.9781611973730.70"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Leme, R.P., Syrgkanis, V., Tardos, E.: Sequential auctions and externalities. In: Proceedings of the 2012 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 869\u2013886 (2012). https:\/\/doi.org\/10.1137\/1.9781611973099.70","DOI":"10.1137\/1.9781611973099.70"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-17572-5_26","volume-title":"Internet and Network Economics","author":"U Nadav","year":"2010","unstructured":"Nadav, U., Roughgarden, T.: The limits of smoothness: a primal-dual framework for price of anarchy bounds. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 319\u2013326. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17572-5_26"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 513\u2013522. Association for Computing Machinery, New York (2009). https:\/\/doi.org\/10.1145\/1536414.1536485","DOI":"10.1145\/1536414.1536485"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Syrgkanis, V., Tardos, E.: Bayesian sequential auctions. In: Proceedings of the 13th ACM Conference on Electronic Commerce, pp. 929\u2013944. Association for Computing Machinery, New York (2012). https:\/\/doi.org\/10.1145\/2229012.2229082","DOI":"10.1145\/2229012.2229082"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Syrgkanis, V., Tardos, E.: Composable and efficient mechanisms. In: Proceedings of 45th Annual ACM Symposium on Theory of Computing, pp. 211\u2013220. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2488608.2488635","DOI":"10.1145\/2488608.2488635"},{"key":"11_CR13","unstructured":"Thang, N.K.: Game efficiency through linear programming duality. arXiv Preprint arXiv:1708.06499v1 (2017)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64946-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:06:24Z","timestamp":1607159184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/econcs.pku.edu.cn\/wine2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}