On rational computability and communication complexity

DOI10.1006/GAME.2000.0833MaRDI QIDQ5938625zbMATH OpenOpenAlexFDO

Authors Yoav Shoham, Moshe Tennenholtz

Publication date 2001

Published in Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/8491cd810543ae673a2f6298e01ddd9b730d1ecc

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Signaling and communication in game theory (91A28)

Recommendations

• Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
• On the complexity of computing an equilibrium in combinatorial auctions
• Auction Algorithms for Market Equilibrium
• Auction algorithms for market equilibrium
• On the complexity of price equilibria

Cites work

• scientific article; zbMATH DE number 49749 (Why is no real title available?)
• scientific article; zbMATH DE number 1149401 (Why is no real title available?)
• Optimal auctions revisited
• Optimal Auctions with Risk Averse Buyers

Cited in

(12)

• On complexity of single-minded auction
• Bundling equilibrium in combinatorial auctions
• The complexity of resource allocation and price mechanisms under bounded rationality
• A lower bound on computational complexity given by revelation mechanisms
• Overcoming free riding in multi-party computations -- the anonymous case
• Non-cooperative computation: Boolean functions with correctness and exclusivity
• Computation in a distributed information market
• scientific article; zbMATH DE number 88975 (Why is no real title available?)
• Computation and Complexity in Economic Behavior and Organization
• Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
• Program equilibrium
• On market-inspired approaches to propositional satisfiability

This page was built for publication: On rational computability and communication complexity

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