IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v90y2019i3d10.1007_s00186-019-00685-7.html
   My bibliography  Save this article

A simple construction of complete single-peaked domains by recursive tiling

Author

Listed:
  • Ping Zhan

    (Edogawa University)

Abstract

Single-peakedness was introduced by Black (J Political Econ 56:23–34, 1948) as a sufficient condition to overcome Condorcet paradox. Since then it has been attracting interest from researchers in various fields. In this paper, we propose a simple recursive procedure of constructing complete single-peaked domains of tiling type explicitly for any finite alternative sets, by combining two results published in recent years, and some observations of known results and examples by the author. The underlying basic structure of tiling type and properties of single-peaked domains provided here give a good visualization and make further developments on single-peakedness more easy.

Suggested Citation

  • Ping Zhan, 2019. "A simple construction of complete single-peaked domains by recursive tiling," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 90(3), pages 477-488, December.
    • Handle: RePEc:spr:mathme:v:90:y:2019:i:3:d:10.1007_s00186-019-00685-7
    DOI: 10.1007/s00186-019-00685-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00186-019-00685-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00186-019-00685-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Steven J. Brams & William V. Gehrlein & Fred S. Roberts (ed.), 2009. "The Mathematics of Preference, Choice and Order," Studies in Choice and Welfare, Springer, number 978-3-540-79128-7, June.
    2. Moulin, Hervé, 2017. "One dimensional mechanism design," Theoretical Economics, Econometric Society, vol. 12(2), May.
    3. Ernesto Savaglio & Stefano Vannucci, 2019. "Strategy-proof aggregation rules and single peakedness in bounded distributive lattices," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 52(2), pages 295-327, February.
    4. Puppe, Clemens, 2018. "The single-peaked domain revisited: A simple global characterization," Journal of Economic Theory, Elsevier, vol. 176(C), pages 55-80.
    5. H. Moulin, 1980. "On strategy-proofness and single peakedness," Public Choice, Springer, vol. 35(4), pages 437-455, January.
    6. Bernard Monjardet, 2009. "Acyclic Domains of Linear Orders: A Survey," Studies in Choice and Welfare, in: Steven J. Brams & William V. Gehrlein & Fred S. Roberts (ed.), The Mathematics of Preference, Choice and Order, pages 139-160, Springer.
    7. Gopakumar Achuthankutty & Souvik Roy, 2018. "On single-peaked domains and min–max rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(4), pages 753-772, December.
    8. Ádám Galambos & Victor Reiner, 2008. "Acyclic sets of linear orders via the Bruhat orders," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 30(2), pages 245-264, February.
    9. Bade, Sophie, 2019. "Matching with single-peaked preferences," Journal of Economic Theory, Elsevier, vol. 180(C), pages 81-99.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alexander Karpov & Arkadii Slinko, 2023. "Constructing large peak-pit Condorcet domains," Theory and Decision, Springer, vol. 94(1), pages 97-120, January.
    2. Alexander Karpov, 2020. "The likelihood of single-peaked preferences under classic and new probability distribution assumptions," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 55(4), pages 629-644, December.
    3. Yoshio Sano & Ping Zhan, 2021. "Extended Random Assignment Mechanisms on a Family of Good Sets," SN Operations Research Forum, Springer, vol. 2(4), pages 1-30, December.

    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. Puppe, Clemens, 2018. "The single-peaked domain revisited: A simple global characterization," Journal of Economic Theory, Elsevier, vol. 176(C), pages 55-80.
    2. Li, Guanhao & Puppe, Clemens & Slinko, Arkadii, 2021. "Towards a classification of maximal peak-pit Condorcet domains," Mathematical Social Sciences, Elsevier, vol. 113(C), pages 191-202.
    3. Clemens Puppe & Arkadii Slinko, 2019. "Condorcet domains, median graphs and the single-crossing property," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 67(1), pages 285-318, February.
    4. Li, Guanhao & Puppe, Clemens & Slinko, Arkadii, 2020. "Towards a classification of maximal peak-pit Condorcet domains," Working Paper Series in Economics 144, Karlsruhe Institute of Technology (KIT), Department of Economics and Management.
    5. Chatterji, Shurojit & Roy, Souvik & Sadhukhan, Soumyarup & Sen, Arunava & Zeng, Huaxia, 2022. "Probabilistic fixed ballot rules and hybrid domains," Journal of Mathematical Economics, Elsevier, vol. 100(C).
    6. Arlegi, Ricardo & Teschl, Miriam, 2022. "Pareto rationalizability by two single-peaked preferences," Mathematical Social Sciences, Elsevier, vol. 118(C), pages 1-11.
    7. Puppe, Clemens & Slinko, Arkadii, 2024. "Maximal Condorcet domains. A further progress report," Games and Economic Behavior, Elsevier, vol. 145(C), pages 426-450.
    8. Liu, Peng & Zeng, Huaxia, 2019. "Random assignments on preference domains with a tier structure," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 176-194.
    9. Chatterji, Shurojit & Zeng, Huaxia, 2023. "A taxonomy of non-dictatorial unidimensional domains," Games and Economic Behavior, Elsevier, vol. 137(C), pages 228-269.
    10. Alexander Karpov & Arkadii Slinko, 2023. "Constructing large peak-pit Condorcet domains," Theory and Decision, Springer, vol. 94(1), pages 97-120, January.
    11. Bredereck, Robert & Chen, Jiehua & Woeginger, Gerhard J., 2016. "Are there any nicely structured preference profiles nearby?," Mathematical Social Sciences, Elsevier, vol. 79(C), pages 61-73.
    12. Slinko, Arkadii, 2019. "Condorcet domains satisfying Arrow’s single-peakedness," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 166-175.
    13. Olivier Hudry & Bernard Monjardet, 2010. "Consensus theories: an oriented survey," Post-Print halshs-00504974, HAL.
    14. Madhuparna Karmokar & Souvik Roy & Ton Storcken, 2021. "Necessary and sufficient conditions for pairwise majority decisions on path-connected domains," Theory and Decision, Springer, vol. 91(3), pages 313-336, October.
    15. Zhang, Jun, 2020. "When are efficient and fair assignment mechanisms group strategy-proof?," Games and Economic Behavior, Elsevier, vol. 119(C), pages 251-266.
    16. Puppe, Clemens & Slinko, Arkadii, 2022. "Maximal Condorcet domains: A further progress report," Working Paper Series in Economics 159, Karlsruhe Institute of Technology (KIT), Department of Economics and Management.
    17. Li, Guanhao, 2023. "A classification of peak-pit maximal Condorcet domains," Mathematical Social Sciences, Elsevier, vol. 125(C), pages 42-57.
    18. Shurojit Chatterji & Huaxia Zeng, 2022. "A Taxonomy of Non-dictatorial Unidimensional Domains," Papers 2201.00496, arXiv.org, revised Oct 2022.
    19. Alexander Karpov, 2019. "On the Number of Group-Separable Preference Profiles," Group Decision and Negotiation, Springer, vol. 28(3), pages 501-517, June.
    20. Chatterji, Shurojit & Zeng, Huaxia, 2018. "On random social choice functions with the tops-only property," Games and Economic Behavior, Elsevier, vol. 109(C), pages 413-435.

    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:spr:mathme:v:90:y:2019:i:3:d:10.1007_s00186-019-00685-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.