Sciweavers

350 search results - page 12 / 70
» Approximation Algorithms for Unique Games
Sort
View
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
14 years 7 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 5 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
ATAL
2008
Springer
13 years 9 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
SODA
2012
ACM
226views Algorithms» more  SODA 2012»
11 years 10 months ago
On the hardness of pricing loss-leaders
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
Preyas Popat, Yi Wu
IJCAI
2003
13 years 8 months ago
A Continuation Method for Nash Equilibria in Structured Games
We describe algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs). The algorithms...
Ben Blum, Christian R. Shelton, Daphne Koller