On the Likelihood of Cyclic Comparisons
We investigate the procedure of "random sampling" where the alternatives are random variables. When comparing any two alternatives, the decision maker samples each of the alternatives once and ranks them according to the comparison between the two realizations. Our main result is that when applied to three alternatives, the procedure yields a cycle with a probability bounded above by 8/27. Bounds are also obtained for other related procedures.
|Date of creation:||27 Apr 2011|
|Date of revision:||12 Feb 2012|
|Contact details of provider:|| Postal: Boston College, 140 Commonwealth Avenue, Chestnut Hill MA 02467 USA|
Web page: http://fmwww.bc.edu/EC/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Osborne, Martin J & Rubinstein, Ariel, 1998.
"Games with Procedurally Rational Players,"
American Economic Review,
American Economic Association, vol. 88(4), pages 834-847, September.
- Martin J. Osborne & Ariel Rubinstein, 1997. "Games with Procedurally Rational Players," Department of Economics Working Papers 1997-02, McMaster University.
- Osborne, M-J & Rubinstein, A, 1997. "Games with Procedurally Rational Players," Papers 4-97, Tel Aviv.
- Chris Starmer, 2000. "Developments in Non-expected Utility Theory: The Hunt for a Descriptive Theory of Choice under Risk," Journal of Economic Literature, American Economic Association, vol. 38(2), pages 332-382, June. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:boc:bocoec:773. 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: (Christopher F Baum)
If references are entirely missing, you can add them using this form.