Sciweavers

374 search results - page 23 / 75
» Generalized Nash equilibrium problems
Sort
View
WINE
2005
Springer
118views Economy» more  WINE 2005»
14 years 1 months ago
Nash Equilibria and Dominant Strategies in Routing
Nash equilibria and dominant strategies are two of the major approaches to deal with selfishness in an automated system (AS), where each agent is a selfish entity. In this paper,...
Weizhao Wang, Xiang-Yang Li, Xiaowen Chu
AMMA
2009
Springer
14 years 2 months ago
Manipulating Scrip Systems: Sybils and Collusion
Abstract. Game-theoretic analyses of distributed and peer-to-peer systems typically use the Nash equilibrium solution concept, but this explicitly excludes the possibility of strat...
Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern
CORR
2008
Springer
102views Education» more  CORR 2008»
13 years 7 months ago
Game Theory with Costly Computation
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
Joseph Y. Halpern, Rafael Pass
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
13 years 6 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
SIGMETRICS
2010
ACM
208views Hardware» more  SIGMETRICS 2010»
14 years 15 days ago
Dynamics in congestion games
Game theoretic modeling and equilibrium analysis of congestion games have provided insights in the performance of Internet congestion control, road transportation networks, etc. D...
Devavrat Shah, Jinwoo Shin