17 search results - page 1 / 4 » sagt 2010 |
SAGT
2010
Springer
13 years 3 months ago
2010
Springer
SAGT
2010
Springer
13 years 3 months ago
2010
Springer
SAGT
2010
Springer
13 years 3 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....
SAGT
2010
Springer
13 years 3 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...
SAGT
2010
Springer
13 years 3 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...