Sciweavers

54 search results - page 9 / 11
» Complexity Results about Nash Equilibria
Sort
View
ESA
2010
Springer
178views Algorithms» more  ESA 2010»
14 years 11 months ago
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
GAMESEC
2011
287views Game Theory» more  GAMESEC 2011»
13 years 9 months ago
Collaborative Location Privacy with Rational Users
Recent smartphones incorporate embedded GPS devices that enable users to obtain geographic information about their surroundings by providing a location-based service (LBS) with the...
Francisco Santos, Mathias Humbert, Reza Shokri, Je...
ATAL
2007
Springer
15 years 4 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
ATAL
2008
Springer
15 years 2 days ago
Self-interested database managers playing the view maintenance game
A database view is a dynamic virtual table composed of the result set of a query, often executed over different underlying databases. The view maintenance problem concerns how a v...
Hala Mostafa, Victor R. Lesser, Gerome Miklau
AAAI
2012
13 years 13 days ago
Computing Optimal Strategies to Commit to in Stochastic Games
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
Joshua Letchford, Liam MacDermed, Vincent Conitzer...