Results 1  10
of
80,476
Settling the Complexity of Computing TwoPlayer Nash Equilibria
"... We prove that Bimatrix, the problem of finding a Nash equilibrium in a twoplayer game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version) introduced by Papadimitriou in 1991. Our result, building upon the work of Daskalakis, Goldberg, and Papadimitriou on the c ..."
Abstract

Cited by 88 (5 self)
 Add to MetaCart
on the complexity of fourplayer Nash equilibria [21], settles a long standing open problem in algorithmic game theory. It also serves as a starting point for a series of results concerning the complexity of twoplayer Nash equilibria. In particular, we prove the following theorems: • Bimatrix does not have a fully
The Nash Bargaining Solution in Economic Modeling
 Rand Journal of Economics
, 1986
"... This article establishes the relationship between the static axiomatic theory of bargaining and the sequential strategic approach to bargaining. We consider two strategic models of alternating offers. The models differ in the source of the incentive of the bargaining parties to reach agreement: the ..."
Abstract

Cited by 556 (1 self)
 Add to MetaCart
the incentive to settle and with the proper disagreement jfoint chosen. The results provide a guide for the application of the Nash bargaining solution in economic modelling. 1.
Worstcase equilibria
 IN PROCEEDINGS OF THE 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
, 1999
"... In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a ver ..."
Abstract

Cited by 851 (17 self)
 Add to MetaCart
In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a
Parameterized TwoPlayer Nash Equilibrium
"... We study the problem of computing Nash equilibria in a twoplayer normal form (bimatrix) game from the perspective of parameterized complexity. Recent results proved hardness for a number of variants, when parameterized by the support size. We complement those results, by identifying three cases in ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study the problem of computing Nash equilibria in a twoplayer normal form (bimatrix) game from the perspective of parameterized complexity. Recent results proved hardness for a number of variants, when parameterized by the support size. We complement those results, by identifying three cases
Enumeration of Nash Equilibria for TwoPlayer Games
 ECONOMIC THEORY
"... This paper describes algorithms for finding all Nash equilibria of a twoplayer game in strategic form. We present two algorithms that extend earlier work. Our presentation is selfcontained, and explains the two methods in a unified framework using faces of bestresponse polyhedra. The first method ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This paper describes algorithms for finding all Nash equilibria of a twoplayer game in strategic form. We present two algorithms that extend earlier work. Our presentation is selfcontained, and explains the two methods in a unified framework using faces of bestresponse polyhedra. The first method
The complexity of computing a Nash equilibrium
, 2006
"... We resolve the question of the complexity of Nash equilibrium by showing that the problem of computing a Nash equilibrium in a game with 4 or more players is complete for the complexity class PPAD. Our proof uses ideas from the recentlyestablished equivalence between polynomialtime solvability of n ..."
Abstract

Cited by 324 (23 self)
 Add to MetaCart
We resolve the question of the complexity of Nash equilibrium by showing that the problem of computing a Nash equilibrium in a game with 4 or more players is complete for the complexity class PPAD. Our proof uses ideas from the recentlyestablished equivalence between polynomialtime solvability
The Complexity of Pure Nash Equilibria
, 2004
"... We investigate from the computational viewpoint multiplayer games that are guaranteed to have pure Nash equilibria. We focus on congestion games, and show that a pure Nash equilibrium can be computed in polynomial time in the symmetric network case, while the problem is PLScomplete in general. ..."
Abstract

Cited by 172 (6 self)
 Add to MetaCart
We investigate from the computational viewpoint multiplayer games that are guaranteed to have pure Nash equilibria. We focus on congestion games, and show that a pure Nash equilibrium can be computed in polynomial time in the symmetric network case, while the problem is PLScomplete in general
ENGINEERING COOPERATION IN TWOPLAYER GAMES
, 2009
"... Selfish, strategic players may benefit from cooperation, provided they reach an agreement. It is therefore important to construct mechanisms that enable such cooperation, especially in the case of asymmetric private information. There are two major issues: (1) the determination of a fair and effici ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Selfish, strategic players may benefit from cooperation, provided they reach an agreement. It is therefore important to construct mechanisms that enable such cooperation, especially in the case of asymmetric private information. There are two major issues: (1) the determination of a fair
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
Results 1  10
of
80,476