Asymptotically optimal communication in simple mechanisms

DOI10.1007/978-3-030-57980-7_2zbMATH Open1506.91063OpenAlexW3084102547MaRDI QIDQ2109943FDOQ2109943

Authors: Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos 

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-57980-7_2

Recommendations

• scientific article
• Algorithms - ESA 2003
• The communication complexity of private value single-item auctions
• Communication and efficiency in auctions
• The communication burden of payment determination

Mathematics Subject Classification ID

Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Discrete location and assignment (90B80) Algorithmic game theory and complexity (91A68)

Cited In (8)

• The communication cost of selfishness
• Efficient Information Exchange in the Random Phone-Call Model
• ``Tell me what you need: signaling with limited resources
• Breathe before speaking
• Universal protocols for information dissemination using emergent signals
• Determining Optimal Rates for Communication for Omniscience
• The communication burden of payment determination
• On Optimality in Probability and Almost Surely for Processes with a Communication Property. I. The Discrete Time Case

This page was built for publication: Asymptotically optimal communication in simple mechanisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109943)