159
click to vote
SAGT
15 years 2 months ago
2010 Springer 
Abstract. Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda....
156
click to vote
SAGT
15 years 2 months ago
2010 Springer
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...
138
click to vote
SAGT
15 years 2 months ago
2010 Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
149
click to vote
SAGT
15 years 2 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...
|
Game Theory