Sciweavers

SAGT
2010
Springer
348views Game Theory» more  SAGT 2010»
14 years 11 months ago
No Regret Learning in Oligopolies: Cournot vs. Bertrand
Uri Nadav, Georgios Piliouras
SAGT
2010
Springer
223views Game Theory» more  SAGT 2010»
14 years 11 months ago
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
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....
Vittorio Bilò, Ioannis Caragiannis, Angelo ...
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
14 years 11 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
SAGT
2010
Springer
200views Game Theory» more  SAGT 2010»
14 years 11 months ago
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
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...
Vijay V. Vazirani
SAGT
2010
Springer
191views Game Theory» more  SAGT 2010»
14 years 11 months ago
Complexity of Safe Strategic Voting
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...
Noam Hazon, Edith Elkind
Game Theory
Top of PageReset Settings