294 search results - page 17 / 59 » The complexity of computing a Nash equilibrium |
MOR
2010
14 years 8 months ago
2010
The goal of the current paper is to introduce the notion of certificates which verify the accuracy of solutions of computational problems with convex structure; such problems inc...
102
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We consider the existence of Partition Equilibrium in Resource Selection Games. Super-strong equilibrium, where no subset of players has an incentive to change their stra...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Two-player games of billiards, of the sort seen in recent Computer Olympiads held by the International Computer Games Association, are an emerging area with unique challenges for ...