10 search results - page 2 / 2 » Computing the Equilibria of Bimatrix Games Using Dominance H... |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
ECAI
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
AMEC
2003
Springer
13 years 11 months ago
2003
Springer
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
CP
2007
Springer
14 years 12 days ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
SIGECOM
2009
ACM
14 years 22 days ago
2009
ACM
We study the relationship between the social cost of correlated equilibria and the social cost of Nash equilibria. In contrast to previous work focusing on the possible benefits ...