On rational computability and communication complexity

DOI10.1006/game.2000.0833zbMath1103.91323OpenAlexW2093456109MaRDI QIDQ5938625

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)

Related Items (6)

Bundling equilibrium in combinatorial auctions ⋮ On complexity of single-minded auction ⋮ Program equilibrium ⋮ Overcoming free riding in multi-party computations -- the anonymous case ⋮ Computation in a distributed information market ⋮ On market-inspired approaches to propositional satisfiability

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal Auctions with Risk Averse Buyers
• Optimal auctions revisited

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