350 search results - page 20 / 70 » Approximation Algorithms for Unique Games |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
SIGECOM
2003
ACM
14 years 24 days ago
2003
ACM
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
AGI
2011
12 years 11 months ago
2011
General Game Playing (GGP) contest provides a research framework suitable for developing and testing AGI approaches in game domain. In this paper, we propose a new modification of...
QEST
2008
IEEE
14 years 1 months ago
2008
IEEE
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...