Fault Tolerant Implementation
AbstractIn this paper we investigate the implementation problem arising when some of the players are “faulty” in the sense that they fail to act optimally. The planner and the non-faulty players only know that there can be at most k faulty players in the population. However, they know neither the identity of the faulty players, their exact number nor how faulty players behave. We define a solution concept which requires a player to optimally respond to the non-faulty players regardless of the identity and actions of the faulty players. We introduce a notion of fault tolerant implementation, which unlike standard notions of full implementation, also requires robustness to deviations from the equilibrium. The main result of this paper establishes that under symmetric information any choice rule that satisfies two properties—k-monotonicity and no veto power—can be implemented by a strategic game form if there are at least three players and the number of faulty players is less than 1\2n−1. As an application of our result we present examples of simple mechanisms that implement the constrained Walrasian function and a choice rule for the efficient allocation of an indivisible good. Copyright 2002, Wiley-Blackwell.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Oxford University Press in its journal The Review of Economic Studies.
Volume (Year): 69 (2002)
Issue (Month): 3 ()
Contact details of provider:
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Oxford University Press) or (Christopher F. Baum).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.