On rational computability and communication complexity
From MaRDI portal
Publication:5938625
DOI10.1006/game.2000.0833zbMath1103.91323MaRDI 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
68Q25: Analysis of algorithms and problem complexity
91A28: Signaling and communication in game theory
Related Items
Program equilibrium, On market-inspired approaches to propositional satisfiability, On complexity of single-minded auction, Bundling equilibrium in combinatorial auctions, Overcoming free riding in multi-party computations -- the anonymous case, Computation in a distributed information market
Cites Work