294 search results - page 18 / 59 » The complexity of computing a Nash equilibrium |
ACMICEC
2007
ACM
15 years 1 months ago
2007
ACM
We study vindictive bidding, a strategic bidding behavior in keyword auctions where a bidder forces his competitor to pay more without affecting his own payment. We show that most...
QSHINE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract. In this paper, a radio resource sharing scheme for wireless cellular network is investigated to achieve efficiency and fairness among base stations. We propose a credit-t...
FMCO
2004
Springer
15 years 3 months ago
2004
Springer
In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we ...
78
Voted
IJCAI
2003
14 years 11 months ago
2003
We describe algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs). The algorithms...
PRIMA
2007
Springer
15 years 3 months ago
2007
Springer
Multiagent Partially Observable Markov Decision Processes are a popular model of multiagent systems with uncertainty. Since the computational cost for finding an optimal joint pol...