Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Fairness measures for resource allocation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
Strong and correlated strong equilibria in monotone congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Mediators in position auctions
Proceedings of the 8th ACM conference on Electronic commerce
Game-theoretic recommendations: some progress in an uphill battle
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Artificial Intelligence
Journal of Artificial Intelligence Research
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Mediated Equilibria in Load-Balancing Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Equilibrium selection in multistage congestion games for real-time streaming
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Near-strong equilibria in network creation games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Hi-index | 0.00 |
We introduce a general study of routing mediators. A routing mediator can act in a given multi-agent encounter on behalf of the agents that give it the right of play. Routing mediators differ from one another according to the information they may have. Our study concentrates on the use of routing mediators in order to reach correlated strong equilibrium, a multi-agent behavior which is stable against deviations by coalitions. We study the relationships between the power of different routing mediators in establishing correlated strong equilibrium. Surprisingly, our main result shows a natural class of routing mediators that allow to implement fair and efficient outcomes as a correlated super-strong equilibrium in a very wide class of games.