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.
Volume (Year): 16 (1999)
Issue (Month): 4 ()
|Note:||Received: 4 November 1996/Accepted: 13 April 1998|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00355/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:16:y:1999:i:4:p:513-532. 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: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.