4435 search results - page 105 / 887 » Algorithms, games, and the internet |
171
click to vote
AAIM
2009
Springer
16 years 1 months ago
2009
Springer
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
154
click to vote
FOCS
2007
IEEE
16 years 24 days 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...
149
click to vote
SIGECOM
2005
ACM
16 years 10 hour ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
170
click to vote
APPROX
2010
Springer
15 years 8 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...
171
click to vote
CIKM
2005
Springer
15 years 12 months ago
2005
Springer
With this work we aim to make a three-fold contribution. We first address the issue of supporting efficiently queries over string-attributes involving prefix, suffix, containmen...