Sciweavers

Share
DSS
2000
113views more  DSS 2000»
8 years 11 months ago
Quality of service provision in noncooperative networks with diverse user requirements
This paper studies the quality of service (QoS) provision problem in noncooperative networks where applications or users are sel sh and routers implement generalized processor sha...
K. Park, M. Sitharam, S. Chen
CORR
2004
Springer
104views Education» more  CORR 2004»
8 years 12 months ago
Near Rationality and Competitive Equilibria in Networked Systems
A growing body of literature in networked systems research relies on game theory and mechanism design to model and address the potential lack of cooperation between self-intereste...
Nicolas Christin, Jens Grossklags, John Chuang
TCS
2008
8 years 12 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
JDA
2006
80views more  JDA 2006»
8 years 12 months ago
Utilitarian resource assignment
This paper studies a resource allocation problem introduced by Koutsoupias and Papadimitriou. The scenario is modelled as a multiple-player game in which each player selects one o...
Petra Berenbrink, Leslie Ann Goldberg, Paul W. Gol...
JSAC
2008
140views more  JSAC 2008»
8 years 12 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
CSJM
2006
81views more  CSJM 2006»
9 years 17 hour ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
CORR
2008
Springer
125views Education» more  CORR 2008»
9 years 2 days ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre
CORR
2008
Springer
172views Education» more  CORR 2008»
9 years 2 days ago
Altruism in Congestion Games
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...
Martin Hoefer, Alexander Skopalik
CORR
2008
Springer
208views Education» more  CORR 2008»
9 years 2 days ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis
CORR
2008
Springer
137views Education» more  CORR 2008»
9 years 2 days ago
On the Complexity of Nash Equilibria of Action-Graph Games
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...
books