Comparing Position Auctions Computationally
Abstract
Modern techniques for representing games and computing their Nash equilibria are approaching the point where they can be used to analyze market games. We demonstrate this by showing how the equilibria of different position auction mechanisms can be tractably identified using these techniques. These results enable detailed and quantitative comparisons of the different auction mechanisms — in terms of both efficiency and revenue — under different preference models and equilibrium selection criteria.
Cite
Text
Thompson and Leyton-Brown. "Comparing Position Auctions Computationally." AAAI Conference on Artificial Intelligence, 2010. doi:10.1609/AAAI.V24I1.7710Markdown
[Thompson and Leyton-Brown. "Comparing Position Auctions Computationally." AAAI Conference on Artificial Intelligence, 2010.](https://mlanthology.org/aaai/2010/thompson2010aaai-comparing/) doi:10.1609/AAAI.V24I1.7710BibTeX
@inproceedings{thompson2010aaai-comparing,
title = {{Comparing Position Auctions Computationally}},
author = {Thompson, David Robert Martin and Leyton-Brown, Kevin},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2010},
pages = {1694-1697},
doi = {10.1609/AAAI.V24I1.7710},
url = {https://mlanthology.org/aaai/2010/thompson2010aaai-comparing/}
}