Judicial Precedent as a Dynamic Rationale for Axiomatic Bargaining Theory
Axiomatic bargaining theory (e.g., Nash’s theorem) is static. We attempt to provide a dynamic justification for the theory. Suppose a Judge or Arbitrator must allocate utility in a (infinite) sequence of two-person problems; at each date, the Judge is presented with a utility possibility set in R2+. He/she must choose an allocation in the set, constrained only by Nash’s axioms, in the sense that a penalty is paid if and only if a utility allocation is chosen at date T which is inconsistent, according to one of the axioms, with a utility allocation chosen at some earlier date. Penalties are discounted with t, and the Judge chooses any allocation, at a given date, that minimizes the penalty he/she pays as that date. Under what conditions what the Judge’s chosen allocations converge to the Nash allocation over time? We answer this question for three canonical axiomatic bargaining solutions: Nash’s, Kalai-Smorodinsky’s, and the ’egalitarian’ solution, and generalize the analysis to a broad class of axiomatic models.
|Date of creation:||07 May 2010|
|Date of revision:||07 May 2010|
|Contact details of provider:|| Postal: 2, rue de la Charité 13002 Marseille|
Web page: http://www.idep-fr.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:iep:wpidep:1002. 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: (Yves Doazan)
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.