{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T22:37:38Z","timestamp":1774651058426,"version":"3.50.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030579791","type":"print"},{"value":"9783030579807","type":"electronic"}],"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-57980-7_2","type":"book-chapter","created":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T23:04:10Z","timestamp":1599519850000},"page":"17-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Asymptotically Optimal Communication in Simple Mechanisms"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Anagnostides","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris","family":"Fotakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Patsilinakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,8]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10458-006-6105-y","volume":"13","author":"AK Agogino","year":"2006","unstructured":"Agogino, A.K., Tumer, K.: Handling communication restrictions and team formation in congestion games. Auton. Agents Multi Agent Syst. 13(1), 97\u2013115 (2006)","journal-title":"Auton. Agents Multi Agent Syst."},{"issue":"5","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1257\/0002828043052330","volume":"94","author":"LM Ausubel","year":"2004","unstructured":"Ausubel, L.M.: An efficient ascending-bid auction for multiple objects. Am. Econ. Rev. 94(5), 1452\u20131475 (2004)","journal-title":"Am. Econ. Rev."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Ausubel, L.M., Milgrom, P.: The lovely but lonely vickrey auction. In: Combinatorial Auctions, Chapter 1. MIT Press (2006)","DOI":"10.7551\/mitpress\/9780262033428.003.0002"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Babichenko, Y., Rubinstein, A.: Communication complexity of approximate nash equilibria. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 878\u2013889. STOC 2017, Association for Computing Machinery, New York, NY, USA (2017)","DOI":"10.1145\/3055399.3055407"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1086\/256633","volume":"56","author":"D Black","year":"1948","unstructured":"Black, D.: On the rationale of group decision-making. J. Polit. Econ. 56(1), 23\u201334 (1948)","journal-title":"J. Polit. Econ."},{"key":"2_CR6","first-page":"649","volume":"5","author":"A Blum","year":"2004","unstructured":"Blum, A., Jackson, J., Sandholm, T., Zinkevich, M.: Preference elicitation and query learning. J. Mach. Learn. Res. 5, 649\u2013667 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1613\/jair.2081","volume":"28","author":"L Blumrosen","year":"2007","unstructured":"Blumrosen, L., Nisan, N., Segal, I.: Auctions with severely bounded communication. J. Artif. Intell. Res. 28, 233\u2013266 (2007)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/1855118.1855133","volume":"41","author":"A Chattopadhyay","year":"2010","unstructured":"Chattopadhyay, A., Pitassi, T.: The story of set disjointness. SIGACT News 41(3), 59\u201385 (2010)","journal-title":"SIGACT News"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Conen, W., Sandholm, T.: Preference elicitation in combinatorial auctions. In: Proceedings of the 3rd ACM Conference on Electronic Commerce, pp. 256\u2013259. EC 2001, Association for Computing Machinery, New York, NY, USA (2001)","DOI":"10.1145\/501158.501191"},{"key":"2_CR10","unstructured":"Conitzer, V., Sandholm, T.: Vote elicitation: Complexity and strategy-proofness. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, pp. 392\u2013397. AAAI Press\/The MIT Press (2002)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.: Communication complexity of common voting rules. In: Proceedings of the 6th ACM Conference on Electronic Commerce, pp. 78\u201387. EC 2005, Association for Computing Machinery, New York, NY, USA (2005)","DOI":"10.1145\/1064009.1064018"},{"key":"2_CR12","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"2_CR13","volume-title":"Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)","author":"TM Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing). Wiley, USA (2006)"},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1007\/s00453-018-0465-y","volume":"81","author":"A Czumaj","year":"2018","unstructured":"Czumaj, A., Deligkas, A., Fasoulakis, M., Fearnley, J., Jurdzi\u0144ski, M., Savani, R.: Distributed methods for computing approximate equilibria. Algorithmica 81(3), 1205\u20131231 (2018)","journal-title":"Algorithmica"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"David, E., Rogers, A., Schiff, J., Kraus, S., Jennings, N.R.: Optimal design of English auctions with discrete bid levels. In: ACM Conference on Electronic Commerce (EC 2005), pp. 98\u2013107 (2005)","DOI":"10.1145\/1064009.1064020"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Vondr\u00e1k, J.: Communication complexity of combinatorial auctions with submodular valuations. In: Khanna, S. (ed.) Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, pp. 1205\u20131215. SIAM (2013)","DOI":"10.1137\/1.9781611973105.87"},{"issue":"5","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1016\/j.jet.2007.09.015","volume":"144","author":"R Fadel","year":"2009","unstructured":"Fadel, R., Segal, I.: The communication cost of selfishness. J. Econ. Theory 144(5), 1895\u20131920 (2009)","journal-title":"J. Econ. Theory"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., Golomb, I.: On voting and facility location. In: Conitzer, V., Bergemann, D., Chen, Y. (eds.) Proceedings of the 2016 ACM Conference on Economics and Computation, EC 2016, pp. 269\u2013286. ACM (2016)","DOI":"10.1145\/2940716.2940725"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-33996-7_17","volume-title":"Algorithmic Game Theory","author":"PW Goldberg","year":"2012","unstructured":"Goldberg, P.W., Pastink, A.: On the communication complexity of approximate Nash equilibria. In: Serna, M. (ed.) SAGT 2012. LNCS, pp. 192\u2013203. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33996-7_17"},{"key":"2_CR20","unstructured":"Hudson, B., Sandholm, T.: Effectiveness of query types and policies for preference elicitation in combinatorial auctions. In: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, vol. 1, p. 386\u2013393. AAMAS 2004, IEEE Computer Society, USA (2004)"},{"issue":"6","key":"2_CR21","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.2307\/1913557","volume":"55","author":"JH Kagel","year":"1987","unstructured":"Kagel, J.H., Harstad, R.M., Levin, D.: Information impact and allocation rules in auctions with affiliated private values: A laboratory study. Econometrica 55(6), 1275\u20131304 (1987)","journal-title":"Econometrica"},{"issue":"419","key":"2_CR22","doi-asserted-by":"publisher","first-page":"868","DOI":"10.2307\/2234706","volume":"103","author":"JH Kagel","year":"1993","unstructured":"Kagel, J.H., Levin, D.: Independent Private Value Auctions: Bidder Behaviour in First-, Second- and Third-Price Auctions with Varying Numbers of Bidders. Econ. J. 103(419), 868\u2013879 (1993)","journal-title":"Econ. J."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1996)","DOI":"10.1017\/CBO9780511574948"},{"issue":"11","key":"2_CR24","doi-asserted-by":"publisher","first-page":"3257","DOI":"10.1257\/aer.20160425","volume":"107","author":"S Li","year":"2017","unstructured":"Li, S.: Obviously strategy-proof mechanisms. Am. Econ. Rev. 107(11), 3257\u20133287 (2017)","journal-title":"Am. Econ. Rev."},{"issue":"5","key":"2_CR25","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1086\/676931","volume":"122","author":"D Mookherjee","year":"2014","unstructured":"Mookherjee, D., Tsumagari, M.: Mechanism design with communication constraints. J. Polit. Econ. 122(5), 1094\u20131129 (2014)","journal-title":"J. Polit. Econ."},{"issue":"4","key":"2_CR26","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF00128122","volume":"35","author":"H Moulin","year":"1980","unstructured":"Moulin, H.: On strategy-proofness and single peakedness. Public Choice 35(4), 437\u2013455 (1980)","journal-title":"Public Choice"},{"issue":"1","key":"2_CR27","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.jet.2004.10.007","volume":"129","author":"N Nisan","year":"2006","unstructured":"Nisan, N., Segal, I.: The communication requirements of efficient allocations and supporting prices. J. Econ. Theory 129(1), 192\u2013224 (2006)","journal-title":"J. Econ. Theory"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-48835-9_2","volume-title":"Agent Mediated Electronic Commerce","author":"DC Parkes","year":"1999","unstructured":"Parkes, D.C., Ungar, L.H., Foster, D.P.: Accounting for cognitive costs in on-line auction design. In: Noriega, P., Sierra, C. (eds.) AMET 1998. LNCS (LNAI), vol. 1571, pp. 25\u201340. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48835-9_2"},{"issue":"4","key":"2_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2542174.2542175","volume":"1","author":"AD Procaccia","year":"2013","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. ACM Trans. Econ. Comput. 1(4), 1\u201326 (2013)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"1","key":"2_CR30","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0022-0531(84)90160-1","volume":"34","author":"S Reichelstein","year":"1984","unstructured":"Reichelstein, S.: Incentive compatibility and informational requirements. J. Econ. Theory 34(1), 32\u201351 (1984)","journal-title":"J. Econ. Theory"},{"issue":"1","key":"2_CR31","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.jet.2006.09.011","volume":"136","author":"I Segal","year":"2007","unstructured":"Segal, I.: The communication requirements of social choice rules and supporting budget sets. J. Econ. Theory 136(1), 341\u2013378 (2007)","journal-title":"J. Econ. Theory"},{"key":"2_CR32","doi-asserted-by":"publisher","first-page":"989","DOI":"10.2307\/41409970","volume":"35","author":"H Smith","year":"2011","unstructured":"Smith, H., Dinev, T., Xu, H.: Information privacy research: an interdisciplinary review. MIS Q. 35, 989\u20131015 (2011)","journal-title":"MIS Q."},{"issue":"2\/3","key":"2_CR33","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1162\/jeea.2007.5.2-3.543","volume":"5","author":"T Van Zandt","year":"2007","unstructured":"Van Zandt, T.: Communication complexity and mechanism design. J. Eur. Econ. Assoc. 5(2\/3), 543\u2013553 (2007)","journal-title":"J. Eur. Econ. Assoc."},{"issue":"1","key":"2_CR34","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey, W.: Counter speculation, auctions, and competitive sealed tenders. J. Finan. 16(1), 8\u201337 (1961)","journal-title":"J. Finan."}],"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-030-57980-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T19:19:55Z","timestamp":1619205595000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57980-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030579791","9783030579807"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57980-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 September 2020","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":"Augsburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-augsburg.de\/de\/fakultaet\/mntf\/math\/prof\/opt\/team\/harks\/sagt2020\/","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","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":"21","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":"0","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":"40% - 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":"8","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}