Integer Programming on Domains Containing Inseparable Ordered Paris

Francesca Busetto, Giulio Codognato and Simone Tonin

No 2015-22, SIRE Discussion Papers from Scottish Institute for Research in Economics (SIRE)

Abstract: Using the integer programming approach introduced by Sethuraman, 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 Arrovian social welfare functions \without ties," but also Arrovian social welfare functions \with ties," since they satisfy the strictly decomposability 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).

Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10943/610
Our link check indicates that this URL is bad, the error code is: 404 Not Found

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:edn:sirdps:610

Access Statistics for this paper

More papers in SIRE Discussion Papers from Scottish Institute for Research in Economics (SIRE) 31 Buccleuch Place, EH8 9JT, Edinburgh. Contact information at EDIRC.
Bibliographic data for series maintained by Research Office ().