Sciweavers

20 search results - page 4 / 4
» sagt 2009
Sort
View
SAGT
2009
Springer
112views Game Theory» more  SAGT 2009»
13 years 11 months ago
On the Complexity of Iterated Weak Dominance in Constant-Sum Games
Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...
Felix Brandt, Markus Brill, Felix A. Fischer, Paul...
SAGT
2009
Springer
131views Game Theory» more  SAGT 2009»
13 years 11 months ago
The Computational Complexity of Weak Saddles
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
Felix Brandt, Markus Brill, Felix A. Fischer, Jan ...
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
13 years 9 months ago
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
Tanmoy Chakraborty, Sanjeev Khanna
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
13 years 11 months ago
Price of Stability in Survivable Network Design
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
Elliot Anshelevich, Bugra Caskurlu
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
13 years 11 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang