Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity

DOI10.1007/978-3-540-79309-0_19zbMath1136.91332OpenAlexW1532972246MaRDI QIDQ5459985

Markus Bläser, Elias Vicari

Publication date: 2 May 2008

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_19

Mathematics Subject Classification ID

Communication networks in operations research (90B18) 2-person games (91A05) Signaling and communication in game theory (91A28) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Communication complexity of convex optimization
• Test complexity of generic polynomials
• Corrigendum to: Towards a theory of local and global in computation
• The communication complexity of computing differentiable functions in a multicomputer network
• Truth revelation in approximately efficient combinatorial auctions
• Approximation techniques for utilitarian mechanism design
• Lower Bounds on Information Transfer in Distributed Computations
• On the communication complexity of distributed algebraic computation
• Communication Complexity
• Algebra
• Sharing the cost of multicast transmissions

This page was built for publication: Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity