On complexity as bounded rationality (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the existence of equilibria in noncooperative optimal flow control
Journal of the ACM (JACM)
Randomized algorithms
Making greed work in networks: a game-theoretic analysis of switch service disciplines
IEEE/ACM Transactions on Networking (TON)
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Algorithmic Game Theory
Algorithms for selfish agents mechanism design for distributed computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Game authority for robust and scalable distributed selfish-computer systems
Theoretical Computer Science
Computing pure strategy nash equilibria in compact symmetric games
Proceedings of the 11th ACM conference on Electronic commerce
Window-games between TCP flows
Theoretical Computer Science
On the inefficiency of equilibria in linear bottleneck congestion games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Coalition formation and price of anarchy in cournot oligopolies
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Discrete strategies in keyword auctions and their inefficiency for locally aware bidders
WINE'10 Proceedings of the 6th international conference on Internet and network economics
An adaptive control technique for a connection weight of agents in a self-repairing network
IWSOS'11 Proceedings of the 5th international conference on Self-organizing systems
On a bounded budget network creation game
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Improving the price of anarchy for selfish routing via coordination mechanisms
ESA'11 Proceedings of the 19th European conference on Algorithms
Spatial distribution of connection weight in self-repairing network
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part IV
The price of optimum in a matching game
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Journal of Combinatorial Optimization
A strategy distribution of a self-repairing network in dynamic environments
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Adaptive strategies: toward a design of adaptive systems for dynamic environments
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
The price of anarchy on uniformly related machines revisited
Information and Computation
A systemic payoff in a self-repairing network
Artificial Life and Robotics
Efficient methods for selfish network design
Theoretical Computer Science
Pairwise cooperations in selfish ring routing for minimax linear latency
Theoretical Computer Science
SIAM Journal on Computing
Conflicting Congestion Effects in Resource Allocation Games
Operations Research
Minimizing rosenthal potential in multicast games
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
On a noncooperative model for wavelength assignment in multifiber optical networks
IEEE/ACM Transactions on Networking (TON)
Preemptive coordination mechanisms for unrelated machines
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Minimizing expectation plus variance
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Convergence of best-response dynamics in games with conflicting congestion effects
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
On incentivizing upload capacity in P2P-VoD systems: Design, analysis and evaluation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Altruism in Atomic Congestion Games
ACM Transactions on Economics and Computation
On Nash Equilibria for a Network Creation Game
ACM Transactions on Economics and Computation
Theoretical Computer Science
Theory of Computing Systems
| Hi-index | 0.00 |
In a system where noncooperative agents share a common resource, we propose the price of anarchy, which is the ratio between the worst possible Nash equilibrium and the social optimum, as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model where several agents share a very simple network leads to some interesting mathematics, results, and open problems.