Sciweavers

1410 search results - page 13 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
FOCS
2010
IEEE
14 years 7 months ago
Subexponential Algorithms for Unique Games and Related Problems
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
Sanjeev Arora, Boaz Barak, David Steurer
TACAS
2004
Springer
127views Algorithms» more  TACAS 2004»
15 years 2 months ago
MetaGame: An Animation Tool for Model-Checking Games
Abstract. Failing model checking runs should be accompanied by appropriate error diagnosis information that allows the user to identify the cause of the problem. For branching time...
Markus Müller-Olm, Haiseung Yoo
SIGECOM
2010
ACM
165views ECommerce» more  SIGECOM 2010»
15 years 2 months ago
Computing optimal strategies to commit to in extensive-form games
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
Joshua Letchford, Vincent Conitzer
CORR
2011
Springer
212views Education» more  CORR 2011»
14 years 3 months ago
Path coalitional games
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
Haris Aziz, Troels Bjerre Sørensen
CORR
2012
Springer
286views Education» more  CORR 2012»
13 years 5 months ago
A Faster Algorithm for Solving One-Clock Priced Timed Games
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter ...