Asymptotically optimal communication in simple mechanisms

DOI10.1007/978-3-030-57980-7_2MaRDI QIDQ2109943zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(9)

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

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)