Comparison functions and choice correspondences
In this paper, we introduce the concept of a comparison function, which is a mapping g that assigns numbers to ordered pairs of alternatives (x,y) with the property that g(x,y)=- g(y,x). The paper discusses how some well-known choice correspondences on tournaments such as the uncovered set, the minimal covering set and the bipartisan set can be extended to this general framework. Axiomatic characterizations and properties are studied for these correspondences.
(This abstract was borrowed from another version of this item.)
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:||1998|
|Date of revision:|
|Contact details of provider:|| Postal: 33, boulevard du port - 95011 Cergy-Pontoise Cedex|
Phone: 33 1 34 25 60 63
Fax: 33 1 34 25 62 33
Web page: http://thema.u-cergy.fr
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ema:worpap:98-12. 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: (Stefania Marcassa)
If references are entirely missing, you can add them using this form.