Search arXivSearch

arXiv · cs/0512083

New directions in mechanism design

Abstract

Mechanism design uses the tools of economics and game theory to design rules of interaction for economic transactions that will,in principle, yield some de- sired outcome. In the last few years this field has received much interest of researchers in computer science, especially with the Internet developing as a platform for communications and connections among enormous numbers of computers and humans. Arguably the most positive result in mechanism de- sign is truthful and there are only one general truthful mechanisms so far : the generalized Vickrey-Clarke-Groves (VCG) mechanism. But VCG mecha- nism has one shortage: The implementation of truthfulness is on the cost of decreasing the revenue of the mechanism. (e.g., Ning Chen and Hong Zhu. [1999]). We introduce three new characters of mechanism:partly truthful, criti- cal, consistent, and introduce a new mechanism: X mechanism that satisfy the above three characters. Like VCG mechanism, X mechanism also generalizes from Vickery Auction and is consistent with Vickery auction in many ways, but the extended methods used in X mechanism is different from that in VCG mechanism . This paper will demonstrate that X mechanism better than VCG mechanism in optimizing utility of mechanism, which is the original intention of mechanism design. So partly truthful,critical and consistent are at least as important as truthful in mechanism design, and they beyond truthful in many situations.As a result, we conclude that partly truthful,critical and consistent are three new directions in mechanism design.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiangtao Meng. 2005-12-22. New directions in mechanism design. https://arxiv.org/abs/cs/0512083

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Learning in Structured Stackelberg Games

We initiate the study of structured Stackelberg games, a novel form of strategic interaction between a leader and a follower where contextual information can be predictive of the follower's (unknown) type. Motivated by applications such as security games and AI safety, we show how this additional structure can help the leader learn a utility-maximizing policy in both the online and distributional settings. In the online setting, we first prove that standard learning-theoretic measures of complexity do not characterize the difficulty of the leader's learning task. Notably, we find that there exists a learning-theoretic measure of complexity, analogous to the Littlestone dimension in online classification, that tightly characterizes the leader's instance-optimal regret. We term this the Stackelberg-Littlestone dimension, and leverage it to provide a provably optimal online learning algorithm. In the distributional setting, we provide analogous results by showing that two new dimensions control the sample complexity upper- and lower-bound.

cs.GT

Equilibrium and Infeasibility: A new solution concept for games

Addressing infeasibility in non-cooperative games has become an important topic, as many problems across different applications face this issue. In this paper, we propose a new solution concept for generalized games with possibly infeasible individual constraints. A solution is defined as the limit of a sequence of generalized Nash equilibria induced by games with penalty terms relaxing the individual constraints. Existence is established for a broad range of games and we provide conditions allowing to characterize a $ψ$-penalized solution as a strategy profile maximizing every player's utility over all her penalty minimizing strategies. A variation of Divide-the-Dollar serves as an illustrative example. We further establish the compatibility with the GNE and the solution to the Nash bargaining.

cs.GT

Subgame-Perfect Nash Equilibria of Plurality Voting with Abstention: a PSPACE-Completeness Result for Restricted Ballots

We consider sequential Plurality elections in which each voter may abstain or vote for a single candidate. Each voter assigns utilities to all candidates; for each voter, this induces a (weak) order over the candidates. Ties are resolved uniformly at random, and voting has a small positive cost, so that a voter prefers to abstain when their vote cannot change the election outcome. We consider a variant of this model where, for each voter, we additionally specify a prefix of her ranking, so that she is only allowed to vote for a candidate from that prefix (or abstain). We prove that for this variant of the model, deciding whether a designated candidate is among the election winners in a subgame-perfect equilibrium of the associated extensive-form game is PSPACE-complete. This partially resolves an open problem from the work of Desmedt and Elkind [2010].

cs.GT