Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
From MaRDI portal
Publication:5459985
DOI10.1007/978-3-540-79309-0_19zbMATH Open1136.91332OpenAlexW1532972246MaRDI QIDQ5459985FDOQ5459985
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
Recommendations
2-person games (91A05) Communication networks in operations research (90B18) Signaling and communication in game theory (91A28) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Communication Complexity
- Algebra
- Truth revelation in approximately efficient combinatorial auctions
- Sharing the cost of multicast transmissions
- Title not available (Why is that?)
- Approximation techniques for utilitarian mechanism design
- Lower Bounds on Information Transfer in Distributed Computations
- 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
- Title not available (Why is that?)
- On the communication complexity of distributed algebraic computation
Cited In (4)
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)