294 search results - page 11 / 59 » The complexity of computing a Nash equilibrium |
ANOR
2005
14 years 9 months ago
2005
The main objects here are finite-strategy games in which entropic terms are subtracted from the payoffs. After such subtraction each Nash equilibrium solves an explicit, unconstra...
101
click to vote
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
DIALM
2003
ACM
15 years 3 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
ICPP
2009
IEEE
15 years 4 months ago
2009
IEEE
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...