Efficient noise-tolerant learning from statistical queries
Journal of the ACM (JACM)
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
When selfish meets evil: byzantine players in a virus inoculation game
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On the Impact of Combinatorial Structure on Congestion Games
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Congestion games with malicious players
Proceedings of the 8th ACM conference on Electronic commerce
Convergence time to Nash equilibrium in load balancing
ACM Transactions on Algorithms (TALG)
Algorithmic Game Theory
Fast convergence to nearly optimal solutions in potential games
Proceedings of the 9th ACM conference on Electronic commerce
Proceedings of the 10th ACM conference on Electronic commerce
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Convergence and approximation in potential games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Market sharing games applied to content distribution in ad hoc networks
IEEE Journal on Selected Areas in Communications
Proceedings of the 10th ACM conference on Electronic commerce
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
The snowball effect of uncertainty in potential games
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Risk sensitivity of price of anarchy under uncertainty
Proceedings of the fourteenth ACM conference on Electronic commerce
3GOL: power-boosting ADSL using 3G onloading
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
Hi-index | 0.00 |
We study the degree to which small fluctuations in costs in well-studied potential games can impact the result of natural best-response and improved-response dynamics. We call this the Price of Uncertainty and study it in a wide variety of potential games (including fair cost-sharing games, set-cover games, routing games, and job-scheduling games), finding a number of surprising results. In particular, we show that in certain cases, even extremely small fluctuations can cause these dynamics to spin out of control and move to states of much higher social cost, whereas in other cases these dynamics are much more stable even to large degrees of fluctuation. We also consider the resilience of these dynamics to a small number of Byzantine players about which no assumptions are made. We show again a contrast between different games. In certain cases (e.g., fair cost-sharing, set-covering, job-scheduling) even a single Byzantine player can cause best-response dynamics to transition to states of substantially higher cost, whereas in others (e.g., the class of beta-nice games which includes routing, market-sharing and many others) these dynamics are much more resilient.