5995 search results - page 185 / 1199 » Algorithmic Game Theory |
123
Voted
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
135
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
111
click to vote
AAIM
2006
Springer
15 years 10 months ago
2006
Springer
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
122
Voted
SBRN
2002
IEEE
15 years 8 months ago
2002
IEEE
This article presents the system “Neural Connect 4”, a program that plays the game Connect Four. This system employs the multilayer perceptron architecture which is learning t...
126
Voted
BIRTHDAY
2008
Springer
15 years 6 months ago
2008
Springer
The Scholten/Dijkstra "Pebble Game" is re-examined. We show that the algorithm lends itself to a distributed as well as an online version, and even to a reversed variant....