Skip to main content

Research Repository

Advanced Search

Integer Programming on Domains Containing Inseparable Ordered Pairs

Busetto, F.; Codognato, G.; Tonin, S.

Integer Programming on Domains Containing Inseparable Ordered Pairs Thumbnail


Authors

F. Busetto

G. Codognato

S. Tonin



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 (2015). 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).

Citation

Busetto, F., Codognato, G., & Tonin, S. (2018). Integer Programming on Domains Containing Inseparable Ordered Pairs. Research in Economics, 72(4), 428-434. https://doi.org/10.1016/j.rie.2018.08.001

Journal Article Type Article
Acceptance Date Aug 17, 2018
Online Publication Date Aug 21, 2018
Publication Date Dec 1, 2018
Deposit Date Aug 28, 2018
Publicly Available Date Feb 21, 2020
Journal Research in Economics
Print ISSN 1090-9443
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 72
Issue 4
Pages 428-434
DOI https://doi.org/10.1016/j.rie.2018.08.001
Public URL https://durham-repository.worktribe.com/output/1316141

Files




You might also like



Downloadable Citations