38 search results - page 6 / 8 » On the computational complexity of qualitative coalitional g... |
SAGT
2010
Springer
13 years 8 months ago
2010
Springer
A key solution concept in cooperative game theory is the core. The core of an expense sharing game contains stable allocations of the total cost to the participating players, such ...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
LICS
2009
IEEE
14 years 4 months ago
2009
IEEE
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
SAGT
2010
Springer
13 years 8 months ago
2010
Springer
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...