294 search results - page 38 / 59 » The complexity of computing a Nash equilibrium |
145
click to vote
AGENTS
2000
Springer
15 years 9 months ago
2000
Springer
This paper considers resource allocation in a network with mobile agents competing for computational priority. We formulate this problem as a multi-agent game with the players bei...
137
click to vote
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
We present Tartanian, a game theory-based player for headsup no-limit Texas Hold'em poker. Tartanian is built from three components. First, to deal with the virtually infinit...
130
click to vote
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
With this paper we offer a game-theoretic perspective for the all-pervasive matching problem in computer vision. Specifically, we formulate the matching problem as a (population) ...
151
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
Channel allocation was extensively investigated in the framework of cellular networks, but it was rarely studied in the wireless ad-hoc networks, especially in the multi-hop ad-ho...
127
click to vote
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In this work, we consider an interesting variant of the wellstudied KP model [18] for selfish routing that reflects some influence from the much older Wardrop model [3...