Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SAGT
2010
Springer
186views Game Theory» more  SAGT 2010»
11 years 3 months ago
On the Efficiency of Markets with Two-Sided Proportional Allocation Mechanisms
We analyze the performance of single-parameter mechanisms for markets in which there is competition amongst both consumers and suppliers (namely, two-sided markets). Specifically, ...
Volodymyr Kuleshov, Adrian Vetta
SAGT
2010
Springer
223views Game Theory» more  SAGT 2010»
11 years 3 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
200views Game Theory» more  SAGT 2010»
11 years 3 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
127views Game Theory» more  SAGT 2010»
11 years 3 months ago
On the Rate of Convergence of Fictitious Play
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the...
Felix Brandt, Felix A. Fischer, Paul Harrenstein
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
11 years 3 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik
SAGT
2010
Springer
156views Game Theory» more  SAGT 2010»
11 years 3 months ago
Partition Equilibrium Always Exists in Resource Selection Games
Abstract. We consider the existence of Partition Equilibrium in Resource Selection Games. Super-strong equilibrium, where no subset of players has an incentive to change their stra...
Elliot Anshelevich, Bugra Caskurlu, Ameya Hate
SAGT
2010
Springer
157views Game Theory» more  SAGT 2010»
11 years 3 months ago
On the Structure of Weakly Acyclic Games
The class of weakly acyclic games, which includes potential games and dominance-solvable games, captures many practical application domains. Informally, a weakly acyclic game is on...
Alex Fabrikant, Aaron D. Jaggard, Michael Schapira
SAGT
2010
Springer
164views Game Theory» more  SAGT 2010»
11 years 3 months ago
On Nash-Equilibria of Approximation-Stable Games
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum,...
SAGT
2010
Springer
348views Game Theory» more  SAGT 2010»
11 years 3 months ago
No Regret Learning in Oligopolies: Cournot vs. Bertrand
Uri Nadav, Georgios Piliouras
SAGT
2010
Springer
151views Game Theory» more  SAGT 2010»
11 years 3 months ago
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users
Abstract. We consider network congestion games in which a finite number of non-cooperative users select paths. The aim is to mitigate the inefficiency caused by the selfish users...
Dimitris Fotakis, George Karakostas, Stavros G. Ko...
books