Sciweavers

Share
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
9 years 6 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
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
9 years 6 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
ICPP
2009
IEEE
9 years 6 months ago
Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
Jonathan Widger, Daniel Grosu
ICC
2009
IEEE
148views Communications» more  ICC 2009»
9 years 6 months ago
A Game-Theoretic Analysis of Inter-Session Network Coding
Abstract— A common assumption in the network coding literature is that the users are cooperative and will not pursue their own interests. However, this assumption can be violated...
Amir Hamed Mohsenian Rad, Jianwei Huang, Vincent W...
CSE
2009
IEEE
9 years 6 months ago
Parallel Computation of Nash Equilibria in N-Player Games
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
Jonathan Widger, Daniel Grosu
ICALP
2009
Springer
9 years 11 months ago
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...
Michael Ummels, Dominik Wojtczak
STOC
2004
ACM
84views Algorithms» more  STOC 2004»
9 years 11 months ago
Computing Nash equilibria for scheduling on restricted parallel links
Martin Gairing, Thomas Lücking, Marios Mavron...
STOC
2005
ACM
122views Algorithms» more  STOC 2005»
9 years 11 months ago
The price of anarchy of finite congestion games
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...
George Christodoulou, Elias Koutsoupias
books