STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Belief, awareness, and limited reasoning
Artificial Intelligence
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Fair distribution protocols or how the players replace fortune
Mathematics of Operations Research
On complexity as bounded rationality (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Rational secret sharing and multiparty computation: extended abstract
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Completely fair SFE and coalition-safe cheap talk
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Rational Secure Computation and Ideal Mechanism Design
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Extensive games with possibly unaware players
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Optimizing scrip systems: efficiency, crashes, hoarders, and altruists
Proceedings of the 8th ACM conference on Electronic commerce
Unawareness, beliefs and games
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Unawareness and strategic announcements in games with uncertainty
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Lower bounds on implementing robust and resilient mediators
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Cryptography and game theory: designing protocols for exchanging information
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Rational secret sharing, revisited
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Rationality and adversarial behavior in multi-party computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Beyond nash equilibrium: solution concepts for the 21st century
GameSec'11 Proceedings of the Second international conference on Decision and Game Theory for Security
Sharing Rewards Among Strangers Based on Peer Evaluations
Decision Analysis
Bayesian mechanism design with efficiency, privacy, and approximate truthfulness
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
On the complexity of trial and error
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Nash equilibrium is the most commonly-used notion of equilibrium in game theory. However, it suffers from numerous problems. Some are well known in the game theory community; for example, the Nash equilibrium of repeated prisoner's dilemma is neither normatively nor descriptively reasonable. However, new problems arise when considering Nash equilibrium from a computer science perspective: for example, Nash equilibrium is not robust (it does not tolerate "faulty" or "unexpected" behavior), it does not deal with coalitions, it does not take computation cost into account, and it does not deal with cases where players are not aware of all aspects of the game. Solution concepts that try to address these shortcomings of Nash equilibrium are discussed.