350 search results - page 18 / 70 » Approximation Algorithms for Unique Games |
WINE
2009
Springer
14 years 2 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
A new problem of retrieving social games from unstructured videos is proposed. Social games are characterized by repetitions (with variations) of alternating turns between two pla...
AAAI
2007
13 years 10 months ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...