Sciweavers

Share
CORR
2011
Springer
178views Education» more  CORR 2011»
8 years 10 months ago
Robust Additively Coupled Games
We determine the robust Nash equilibrium (RNE) for a wide range of problems in communications systems and networks that are faced with uncertainty in their parameters’ values. T...
Saeedeh Parsaeefard, Ahmad R. Sharafat, Mihaela va...
CORR
2010
Springer
152views Education» more  CORR 2010»
9 years 1 months ago
Power Allocation and Spectrum Sharing in Multi-User, Multi-Channel Systems with Strategic Users
We consider the decentralized power allocation and spectrum sharing problem in multi-user, multichannel systems with strategic users. We present a mechanism/game form that has the...
Ali Kakhbod, Demosthenis Teneketzis
WAOA
2010
Springer
239views Algorithms» more  WAOA 2010»
9 years 1 months ago
Strategic Multiway Cut and Multicut Games
We consider cut games where players want to cut themselves off from different parts of a network. These games arise when players want to secure themselves from areas of potential i...
Elliot Anshelevich, Bugra Caskurlu, Ameya Hate
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
9 years 2 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
SAGT
2010
Springer
164views Game Theory» more  SAGT 2010»
9 years 2 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
175views Game Theory» more  SAGT 2010»
9 years 2 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
MST
2010
110views more  MST 2010»
9 years 2 months ago
Facets of the Fully Mixed Nash Equilibrium Conjecture
In this work, we continue the study of the many facets of the Fully Mixed Nash Equilibrium Conjecture, henceforth abbreviated as the FMNE Conjecture, in selfish routing for the s...
Rainer Feldmann, Marios Mavronicolas, Andreas Pier...
INFOCOM
2010
IEEE
9 years 2 months ago
Wireless Network Virtualization as A Sequential Auction Game
—We propose a virtualization framework to separate the network operator (NO) who focuses on wireless resource management and service providers (SP) who target distinct objectives...
Fangwen Fu, Ulas C. Kozat
INFOCOM
2010
IEEE
9 years 2 months ago
Price of Anarchy in Non-Cooperative Load Balancing
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service disciplin...
Urtzi Ayesta, Olivier Brun, Balakrishna Prabhu
CORR
2010
Springer
164views Education» more  CORR 2010»
9 years 2 months ago
Approximate Nash Equilibria under Stability Conditions
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
Maria-Florina Balcan, Mark Braverman
books