Results 1 to 10 of about 6,388 (100)
Equilibrium in Nash’s mind [PDF]
SSRN Electronic Journal, 2020 Donald Capps suggested the hypothesis that “the Nash equilibrium is descriptive of the normal brain, whereas the game theory formulated by John van Neumann, which Nash’s theory challenges, is descriptive of the schizophrenic brain”. The paper offers arguments in its favor. They are from psychiatry, game theory, set theory, philosophy and theology.
openaire +5 more sources
The Nash equilibrium: A perspective [PDF]
Proceedings of the National Academy of Sciences, 2004 In 1950, John Nash contributed a remarkable one-page PNAS article that defined and characterized a notion of equilibrium for n- person games. This notion, now called the “Nash equilibrium,” has been widely applied and adapted in economics and other behavioral sciences.
Charles A. Holt, Alvin E. Roth
openaire +3 more sources
Logit equilibrium as an approximation of Nash equilibrium [PDF]
Operations Research Letters, 2020 We prove that the graph of the logit equilibrium correspondence is a smooth manifold, which uniformly approximates the graph of the Nash equilibrium manifold.
Eilon Solan, Omri N. Solan
openaire +3 more sources
Nash equilibrium based fairness [PDF]
2009 International Conference on Game Theory for Networks, 2009 There are several approaches of sharing resources among users. There is a noncooperative approach wherein each user strives to maximize its own utility. The most common optimality notion is then the Nash equilibrium. Nash equilibria are generally Pareto inefficient.
Kameda, Hisao +3 more
openaire +9 more sources
Tenacious Selection of Nash Equilibrium [PDF]
The B.E. Journal of Theoretical Economics, 2016 AbstractWe propose a complexity measure and an associated refinement based on the observation that best responses with more variations call for more precise anticipation. The variations around strategy profiles are measured by considering the cardinalities of players’ pure strategy best responses when others’ behavior is perturbed.
Alioğulları, Zeynel Harun +1 more
openaire +7 more sources
Inapproximability of Nash Equilibrium [PDF]
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, 2015 We prove that finding an $ $-approximate Nash equilibrium is PPAD-complete for constant $ $ and a particularly simple class of games: polymatrix, degree 3 graphical games, in which each player has only two actions. As corollaries, we also prove similar inapproximability results for Bayesian Nash equilibrium in a two-player incomplete information game
openaire +4 more sources
Implementation in Mixed Nash Equilibrium [PDF]
SSRN Electronic Journal, 2010 A mechanism implements a social choice correspondence f in mixed Nash equilibrium if at any preference profile, the set of all pure and mixed Nash equilibrium outcomes coincides with the set of f-optimal alternatives at that preference profile. This definition generalizes Maskin’s definition of Nash implementation in that it does not require each ...
Mezzetti, Claudio, Renou, Ludovic
openaire +6 more sources
Nash Equilibrium and Bisimulation Invariance
Logical Methods in Computer Science, 2017 Game theory provides a well-established framework for the analysis of concurrent and multi-agent systems. The basic idea is that concurrent processes (agents) can be understood as corresponding to players in a game; plays represent the possible computation runs of the system; and strategies define the behaviour of agents.
Gutierrez J. +3 more
openaire +10 more sources
On oblivious PTAS's for nash equilibrium [PDF]
Proceedings of the forty-first annual ACM symposium on Theory of computing, 2009 If a game has a Nash equilibrium with probability values that are either zero or Omega(1) then this equilibrium can be found exhaustively in polynomial time. Somewhat surprisingly, we show that there is a PTAS for the games whose equilibria are guaranteed to have small-O(1/n)-values, and therefore large-Omega(n)-supports.
Christos H. Papadimitriou +1 more
openaire +2 more sources
Learning the optimum as a Nash equilibrium [PDF]
Journal of Economic Dynamics and Control, 2000 This paper shows the computational benefits of a game theoretic approach to optimization of high dimensional control problems. A dynamic noncooperative game framework is adopted to partition the control space and to search the optimum as the equilibrium of a k-person dynamic game played by k-parallel genetic algorithms.
Ozyildirim, S., Alemdar, N. M.
openaire +6 more sources