Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity

DOI10.1007/978-3-540-79309-0_19MaRDI QIDQ5459985zbMATH OpenOpenAlexFDO

Authors Markus Bläser, E. 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

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

Recommendations

• On rational computability and communication complexity
• Hardness results for multicast cost sharing.
• Sharing the cost of muliticast transmissions (preliminary version)
• Sharing the cost of multicast transmissions
• On the communication complexity of distributed algebraic computation

Cites work

• scientific article; zbMATH DE number 621807 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 1954379 (Why is no real title available?)
• scientific article; zbMATH DE number 2156280 (Why is no real title available?)
• Algebra
• Approximation techniques for utilitarian mechanism design
• Communication Complexity
• Communication complexity of convex optimization
• Corrigendum to: Towards a theory of local and global in computation
• Lower Bounds on Information Transfer in Distributed Computations
• On the communication complexity of distributed algebraic computation
• Sharing the cost of multicast transmissions
• Test complexity of generic polynomials
• The communication complexity of computing differentiable functions in a multicomputer network
• Truth revelation in approximately efficient combinatorial auctions

Cited in

(5)

• scientific article; zbMATH DE number 6297761 (Why is no real title available?)
• A lower bound on computational complexity given by revelation mechanisms
• On rational computability and communication complexity
• Distributed computing meets game theory
• The communication complexity of distributed task allocation

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

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