IDEAS home Printed from https://ideas.repec.org/p/edn/sirdps/610.html
   My bibliography  Save this paper

Integer Programming on Domains Containing Inseparable Ordered Paris

Author

Listed:
  • Busetto, Francesca
  • Codognato, Giulio
  • Tonin, Simone

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

Suggested Citation

  • Busetto, Francesca & Codognato, Giulio & Tonin, Simone, 2014. "Integer Programming on Domains Containing Inseparable Ordered Paris," SIRE Discussion Papers 2015-22, Scottish Institute for Research in Economics (SIRE).
    • Handle: RePEc:edn:sirdps:610
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10943/610
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Kalai, Ehud & Ritz, Zvi, 1980. "Characterization of the private alternatives domains admitting arrow social welfare functions," Journal of Economic Theory, Elsevier, vol. 22(1), pages 23-36, February.
    2. Francesca Busetto & Giulio Codognato & Simone Tonin, 2012. "Integer Programming and Nondictatorial Arrovian Social Welfare Functions," EconomiX Working Papers 2012-36, University of Paris Nanterre, EconomiX.
    3. Jay Sethuraman & Teo Chung Piaw & Rakesh V. Vohra, 2003. "Integer Programming and Arrovian Social Welfare Functions," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 309-326, May.
    4. Blair, Douglas & Muller, Eitan, 1983. "Essential aggregation procedures on restricted domains of preferences," Journal of Economic Theory, Elsevier, vol. 30(1), pages 34-53, June.
    5. Ritz, Zvi, 1985. "Restricted domains, arrow social welfare functions and noncorruptible and nonmanipulable social choice correspondences: The case of private and public alternatives," Journal of Economic Theory, Elsevier, vol. 35(1), pages 1-18, February.
    6. Kim, Ki Hang & Roush, Fred W., 1981. "Effective nondictatorial domains," Journal of Economic Theory, Elsevier, vol. 24(1), pages 40-47, February.
    7. Ritz, Zvi, 1983. "Restricted domains, arrow-social welfare functions and noncorruptible and non-manipulable social choice correspondences: The case of private alternatives," Mathematical Social Sciences, Elsevier, vol. 4(2), pages 155-179, April.
    8. Sethuraman, Jay & Teo, Chung-Piaw & Vohra, Rakesh V., 2006. "Anonymous monotonic social welfare functions," Journal of Economic Theory, Elsevier, vol. 128(1), pages 232-254, May.
    9. Kalai, Ehud & Muller, Eitan, 1977. "Characterization of domains admitting nondictatorial social welfare functions and nonmanipulable voting procedures," Journal of Economic Theory, Elsevier, vol. 16(2), pages 457-469, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Busetto, Francesca & Codognato, Giulio & Tonin, Simone, 2014. "Integer Programming on Domains Containing Inseparable Ordered Paris," 2007 Annual Meeting, July 29-August 1, 2007, Portland, Oregon TN 2015-22, American Agricultural Economics Association (New Name 2008: Agricultural and Applied Economics Association).
    2. Francesca Busetto & Giulio Codognato & Simone Tonin, 2014. "Integer Programming on Domains Containg Inseparable Ordered Pairs," Working Papers 2014_14, Business School - Economics, University of Glasgow.
    3. Busetto, Francesca & Codognato, Giulio & Tonin, Simone, 2018. "Integer programming on domains containing inseparable ordered pairs," Research in Economics, Elsevier, vol. 72(4), pages 428-434.
    4. Francesca Busetto & Giulio Codognato & Simone Tonin, 2017. "Nondictatorial Arrovian Social Welfare Functions, Simple Majority Rule and Integer Programming," Working Papers 2017_11, Durham University Business School.
    5. Francesca Busetto & Giulio Codognato & Simone Tonin, 2018. "Kalai and Muller’s possibility theorem: a simplified integer programming version," Review of Economic Design, Springer;Society for Economic Design, vol. 22(3), pages 149-157, December.
    6. Georges Bordes & Peter J. Hammond & Michel Le Breton, 2005. "Social Welfare Functionals on Restricted Domains and in Economic Environments," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 7(1), pages 1-25, February.
    7. Francesca Busetto & Giulio Codognato & Simone Tonin, 2012. "Integer Programming and Nondictatorial Arrovian Social Welfare Functions," Working Papers hal-04141048, HAL.
    8. Busetto, Francesca & Codognato, Giulio & Tonin, Simone, 2014. "Nondictatorial Arrovian Social Welfare Functions: An Integer Programming Approach," SIRE Discussion Papers 2015-21, Scottish Institute for Research in Economics (SIRE).
    9. Roy, Souvik & Storcken, Ton, 2019. "A characterization of possibility domains in strategic voting," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 46-55.
    10. Fang-Fang Tang & Yongsheng Xu, 2021. "Corruption in Organizations: Some General Formulations and (In-)Corruptibility Results," Homo Oeconomicus: Journal of Behavioral and Institutional Economics, Springer, vol. 38(1), pages 49-57, December.
    11. Francesca Busetto & Giulio Codognato & Simone Tonin, 2014. "Nondictatorial Arrovian Social Welfare Functions An Integer Programming Approach," Working Papers 2014_13, Business School - Economics, University of Glasgow.
    12. Busetto, Francesca & Codognato, Giulio & Tonin, Simone, 2014. "Nondictatorial Arrovian Social Welfare Functions: An Integer Programming Approach," 2007 Annual Meeting, July 29-August 1, 2007, Portland, Oregon TN 2015-21, American Agricultural Economics Association (New Name 2008: Agricultural and Applied Economics Association).
    13. Clemens Puppe & Attila Tasnádi, 2008. "Nash implementable domains for the Borda count," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(3), pages 367-392, October.
    14. Isaac Lara & Sergio Rajsbaum & Armajac Ravent'os-Pujol, 2024. "A Generalization of Arrow's Impossibility Theorem Through Combinatorial Topology," Papers 2402.06024, arXiv.org, revised Jul 2024.
    15. Ehlers, Lars & Storcken, Ton, 2009. "Oligarchies in spatial environments," Journal of Mathematical Economics, Elsevier, vol. 45(3-4), pages 250-256, March.
    16. Francesca Busetto & Giulio Codognato & Simone Tonin, 2012. "Integer Programming and Nondictatorial Arrovian Social Welfare Functions," EconomiX Working Papers 2012-36, University of Paris Nanterre, EconomiX.
    17. Ehlers, Lars & Storcken, Ton, 2008. "Arrow's Possibility Theorem for one-dimensional single-peaked preferences," Games and Economic Behavior, Elsevier, vol. 64(2), pages 533-547, November.
    18. Ching, Stephen & Serizawa, Shigehiro, 1998. "A Maximal Domain for the Existence of Strategy-Proof Rules," Journal of Economic Theory, Elsevier, vol. 78(1), pages 157-166, January.
    19. Bochet, O.L.A. & Storcken, A.J.A., 2006. "Maximal domains for strategy-proof or Maskin monotonic choice rules," Research Memorandum 003, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    20. Busetto, Francesca & Codognato, Giulio & Tonin, Simone, 2021. "Simple majority rule and integer programming," Mathematical Social Sciences, Elsevier, vol. 113(C), pages 160-163.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:edn:sirdps:610. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Research Office (email available below). General contact details of provider: https://edirc.repec.org/data/sireeuk.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.