Sciweavers

1599 search results - page 82 / 320
» Algorithms for Parity Games
Sort
View
ISPDC
2007
IEEE
15 years 6 months ago
Divisible Load Scheduling: An Approach Using Coalitional Games
Scheduling divisible loads in distributed systems is the subject of Divisible Load Theory (DLT). In this paper we show that coalitional game theory is a natural fit for modeling ...
Thomas E. Carroll, Daniel Grosu
ARGMAS
2004
Springer
15 years 5 months ago
Specifying and Implementing a Persuasion Dialogue Game Using Commitments and Arguments
In this paper we propose a new persuasion dialogue game for agent communication. We show how this dialogue game is modeled by a framework based on social commitments and arguments....
Jamal Bentahar, Bernard Moulin, Brahim Chaib-draa
DAGSTUHL
2007
15 years 1 months ago
The Unique Games Conjecture with Entangled Provers is False
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
AAAI
2006
15 years 1 months ago
Prob-Maxn: Playing N-Player Games with Opponent Models
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
Nathan R. Sturtevant, Martin Zinkevich, Michael H....
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
14 years 10 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani