Sciweavers

1410 search results - page 32 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
ATAL
2007
Springer
15 years 3 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
ISPDC
2007
IEEE
15 years 3 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 2 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
103
Voted
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
14 years 7 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