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
Selfish Routing in Capacitated Networks
Mathematics of Operations Research
Convergence time to Nash equilibrium in load balancing
ACM Transactions on Algorithms (TALG)
Algorithmic Game Theory
Improved equilibria via public service advertising
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
| Hi-index | 0.00 |
In this note we report recent results on the problem of leading natural dynamics to good behavior in games that have both high-quality and low-quality equilibria. We show how a central agency can use a public-service advertising campaign to help "nudge" players' behavior towards a high-quality equilibrium, even if only a fraction of players pay attention. We also discuss results analyzing how well-motivated learning rules, when given additional global information about a game, can be used to effectively reach high-quality equilibria.