- Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted CliquesKord Eickmeyer; Kristoffer Arnstfelt Hansen; Elad VerbinAlgorithmic Game Theory, Springer Berlin Heidelberg, 96-107, 2012.
- Refining Nash Equilibrium by Bayesian Iterative Conjectures ApproachJimmy, TengSSRN Electronic Journal.
- Mixed Nash Implementation with Finite MechanismsClaudio, Mezzetti; Ludovic, RenouSSRN Electronic Journal.
书籍章节
On the Communication Complexity of Approximate Nash Equilibria
5阅读
