On complexity as bounded rationality (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
IEEE/ACM Transactions on Networking (TON)
An analysis of BGP convergence properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
A polynomial-time nash equilibrium algorithm for repeated games
Proceedings of the 4th ACM conference on Electronic commerce
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computing correlated equilibria in multi-player games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Sink Equilibria and Convergence
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Computing Nash Equilibria: Approximation and Smoothed Complexity
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Polynomial algorithms for approximating nash equilibria of bimatrix games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
A note on approximate nash equilibria
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
The connectivity of boolean satisfiability: computational and structural dichotomies
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Designing networks with good equilibria
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The Search for Equilibrium Concepts
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
The Price of Stochastic Anarchy
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective
Graph-Theoretic Concepts in Computer Science
On the complexity of nash dynamics and sink equilibria
Proceedings of the 10th ACM conference on Electronic commerce
Algorithmic Game Theory: A Snapshot
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On the feasibility of static analysis for BGP convergence
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
Communications of the ACM
Dynamics in network interaction games
DISC'09 Proceedings of the 23rd international conference on Distributed computing
On the equilibria of alternating move games
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Mixing time and stationary expected social welfare of logit dynamics
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
On the structure of weakly acyclic games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Designing Network Protocols for Good Equilibria
SIAM Journal on Computing
Weakly-acyclic (internet) routing games
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Convergence method, properties and computational complexity for Lyapunov games
International Journal of Applied Mathematics and Computer Science - SPECIAL SECTION: Efficient Resource Management for Grid-Enabled Applications
On the stability of interdomain routing
ACM Computing Surveys (CSUR)
SIAM Journal on Computing
A theoretical examination of practical game playing: lookahead search
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Best-response dynamics out of sync: complexity and characterization
Proceedings of the fourteenth ACM conference on Electronic commerce
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Weakly-Acyclic (Internet) Routing Games
Theory of Computing Systems
| Hi-index | 0.02 |
We settle the complexity of a well-known problem in networking by establishing that it is PSPACE-complete to tell whether a system of path preferences in the BGP protocol [25] can lead to oscillatory behavior; one key insight is that the BGP oscillation question is in fact one about Nash dynamics. We also show that the concept of sink equilibria proposed recently in [11] is PSPACE-complete to analyze and approximate for graphical games. Finally, we propose a new equilibrium concept inspired by game dynamics, unit recall equilibria, which we show to be close to universal (exists with high probability in a random game) and algorithmically promising. We also give a relaxation thereof, called componentwise unit recall equilibria, which we show to be both tractable and universal (guaranteed to exist in every game).