Logrolling and a McGarvey Theorem for Separable Tournaments
In this note we prove a McGarvey theorem for the family of Separable Tournaments. This family arises in the analysis of Logrolling and Vote Trading in Committees.
(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:||1995|
|Contact details of provider:|| Postal: G.R.E.Q.A.M., (GROUPE DE RECHERCHE EN ECONOMIE QUANTITATIVE D'AIX MARSEILLE), CENTRE DE VIEILLE CHARITE, 2 RUE DE LA CHARITE, 13002 MARSEILLE.|
Web page: http://www.greqam.fr/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fth:aixmeq:95a08. 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 references are entirely missing, you can add them using this form.