3780 search results - page 43 / 756 » Algorithms for Game Metrics |
ACG
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
FOCS
2010
IEEE
13 years 6 months ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
STOC
1994
ACM
14 years 25 days ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
SIGCOMM
1989
ACM
14 years 24 days ago
1989
ACM
The ARPANBT routing metric wasrevised in July 1987,resulting in substantial performance improvements, especially in terms of user delay and effective network capacity. These revis...