Integer Programming on Domains Containg Inseparable Ordered Pairs

Francesca Busetto, Giulio Codognato and Simone Tonin

Working Papers from Business School - Economics, University of Glasgow

Abstract: Using the integer programming approach introduced by Sethura- man, Teo, and Vohra (2003), we extend the analysis of the preference domains containing an inseparable ordered pair, initiated by Kalai and Ritz (1978). We show that these domains admit not only Ar- rovian social welfare functions \without ties," but also Arrovian social welfare functions \with ties," since they satisfy the strictly decom- posability condition introduced by Busetto, Codognato, and Tonin (2012). Moreover, we go further in the comparison between Kalai and Ritz (1978)'s inseparability and Arrow (1963)'s single-peak restrictions, showing that the former condition is more \respectable," in the sense of Muller and Satterthwaite (1985)

JEL-codes: D71 (search for similar items in EconPapers)
Date: 2014-09
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.gla.ac.uk/media/media_360268_en.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gla:glaewp:2014_14

Access Statistics for this paper

More papers in Working Papers from Business School - Economics, University of Glasgow Contact information at EDIRC.
Bibliographic data for series maintained by Business School Research Team ().