Fault Tolerant Implementation
n 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 exact number and identity of the faulty players is unknown to the planner and to the nonfaulty players, but it is common knowledge that there are at most k faulty players. We define a solution concept which requires a player to optimally respond to the nonfaulty 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+1 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. For exchange economies we show that the Walrasian correspondence and the core correspondence are implementable. 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.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1999|
|Date of revision:|
|Contact details of provider:|| Postal: Israel TEL-AVIV UNIVERSITY, THE FOERDER INSTITUTE FOR ECONOMIC RESEARCH, RAMAT AVIV 69 978 TEL AVIV ISRAEL.|
Web page: http://econ.tau.ac.il/foerder/about
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fth:teavfo:21-99. See general 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: (Thomas Krichel)
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.