Competitive Markov decision processes
Competitive Markov decision processes
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Selfish routing with incomplete information
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Mathematical Programming: Series A and B
Stochastic shortest paths via Quasi-convex maximization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Approximation algorithms for stochastic and risk-averse optimization
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Bayesian Combinatorial Auctions
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Proceedings of the 10th ACM conference on Electronic commerce
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Price of anarchy for greedy auctions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for reliable stochastic combinatorial optimization
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Network uncertainty in selfish routing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
When the players are not expectation maximizers
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
GSP auctions with correlated types
Proceedings of the 12th ACM conference on Electronic commerce
Proceedings of the forty-third annual ACM symposium on Theory of computing
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Theory and Applications of Robust Optimization
SIAM Review
Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Price of anarchy of network routing games with incomplete information
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The snowball effect of uncertainty in potential games
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
The price of anarchy in games of incomplete information
Proceedings of the 13th ACM Conference on Electronic Commerce
Minimizing expectation plus variance
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
A theoretical examination of practical game playing: lookahead search
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
| Hi-index | 0.00 |
In algorithmic game theory, the price of anarchy framework studies efficiency loss in decentralized environments. In optimization and decision theory, the price of robustness framework explores the tradeoffs between optimality and robustness in the case of single agent decision making under uncertainty. We establish a connection between the two that provides a novel analytic framework for proving tight performance guarantees for distributed systems in uncertain environments. We present applications of this framework to novel variants of atomic congestion games with uncertain costs, for which we provide tight performance bounds under a wide range of risk attitudes. Our results establish that the individual's attitude towards uncertainty has a critical effect on system performance and should therefore be a subject of close and systematic investigation.