Non-manipulability of uniform price auctions with a large number of objects

International Journal of Game Theory(2018)

引用 0|浏览0
暂无评分
摘要
When agents (bidders) have multi-demand preferences, uniform price auctions are generally not immune to agents’ strategic manipulation, and they may achieve an inefficient allocation. We consider economies in which a large number of identical objects have to be allocated. Agents have quasi-linear preferences with non-increasing incremental valuations. We explore the incentives of agents in uniform price auctions. An important assumption on preferences is proposed, called “no monopoly.” It requires that preferences should be correlated in such a way that no agent’s incremental valuation for an additional object when he receives sufficiently many objects is higher than those of the other agents. We show that under no monopoly and other mild assumptions on preferences, as the number of objects goes to infinity, the payment in any uniform price auction converges to that in a Vickrey auction. We deduce that when there are sufficiently many objects, truth-telling is an approximate Bayesian Nash equilibrium in each uniform price auction.
更多
查看译文
关键词
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\epsilon $$\end{document} -Bayesian Nash equilibrium
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要