Abstract
Computational theorists prove there is no easy algorithm to find Nash equilibria, so game theory will have to look in new directions.
Index Terms
- Always out of balance
Recommendations
Approximately efficient double auctions with strong budget balance
SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithmsMechanism design for one-sided markets is an area of extensive research in economics and, since more than a decade, in computer science as well. Two-sided markets, on the other hand, have not received the same attention despite the numerous applications ...
Partition equilibrium always exists in resource selection games
SAGT'10: Proceedings of the Third international conference on Algorithmic game theoryWe consider the existence of Partition Equilibrium in Resource Selection Games. Super-strong equilibrium, where no subset of players has an incentive to change their strategies collectively, does not always exist in such games. We show, however, that ...
Efficiency and Budget Balance
WINE 2016: Proceedings of the 12th International Conference on Web and Internet Economics - Volume 10123We study efficiency and budget balance for designing mechanisms in general quasi-linear domains. Green and Laffontï ź[13] proved that one cannot generically achieve both. We consider strategyproof budget-balanced mechanisms that are approximately ...
Comments