Sciweavers

601 search results - page 5 / 121
» Playing large games using simple strategies
Sort
View
FOCS
2006
IEEE
15 years 3 months ago
How to Play Unique Games Using Embeddings
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
Eden Chlamtac, Konstantin Makarychev, Yury Makaryc...
CSL
2010
Springer
14 years 10 months ago
Energy and Mean-Payoff Games with Imperfect Information
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...
Aldric Degorre, Laurent Doyen, Raffaella Gentilini...
70
Voted
LICS
2007
IEEE
15 years 3 months ago
Categorical Combinatorics for Innocent Strategies
We show how to construct the category of games and innocent strategies from a more primitive category of games. On that category we define a comonad and monad with the former dis...
Russell Harmer, Martin Hyland, Paul-André M...
JAIR
2008
135views more  JAIR 2008»
14 years 9 months ago
On Similarities between Inference in Game Theory and Machine Learning
In this paper, we elucidate the equivalence between inference in game theory and machine learning. Our aim in so doing is to establish an equivalent vocabulary between the two dom...
Iead Rezek, David S. Leslie, Steven Reece, Stephen...
P2P
2005
IEEE
15 years 3 months ago
Quantifying Agent Strategies under Reputation
Our research proposes a simple buyer/seller game that captures the incentives dictating the interaction between peers in resource trading peer-to-peer networks. We prove that for ...
Sergio Marti, Hector Garcia-Molina