IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v20y1985i3p314-326.html
   My bibliography  Save this article

Networks with condorcet solutions

Author

Listed:
  • Bandelt, Hans-Jurgen

Abstract

No abstract is available for this item.

Suggested Citation

  • Bandelt, Hans-Jurgen, 1985. "Networks with condorcet solutions," European Journal of Operational Research, Elsevier, vol. 20(3), pages 314-326, June.
    • Handle: RePEc:eee:ejores:v:20:y:1985:i:3:p:314-326
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(85)90004-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    Citations

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


    Cited by:

    1. Kawamori, Tomohiko & Yamaguchi, Kazuo, 2010. "Outcomes of bargaining and planning in single facility location problems," Mathematical Social Sciences, Elsevier, vol. 59(1), pages 38-45, January.
    2. Buechel, Berno, 2011. "A note on Condorcet consistency and the median voter," Working Paper Series in Economics 17, Karlsruhe Institute of Technology (KIT), Department of Economics and Management.
    3. Gabrielle Demange, 2012. "Majority relation and median representative ordering," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 3(1), pages 95-109, March.
    4. Mulder, H.M. & Vohra, R.V., 2006. "Axiomatic characterization of the absolute median on cube-free median networks," Econometric Institute Research Papers EI 2006-26, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    5. Clara Rodríguez & José Pérez, 2000. "Comparison of α-Condorcet points with median and center locations," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 8(2), pages 215-234, December.
    6. Itai Feigenbaum & Jay Sethuraman & Chun Ye, 2017. "Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing L p Norm of Costs," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 434-447, May.
    7. Balakrishnan, K. & Changat, M. & Mulder, H.M., 2007. "Median computation in graphs using consensus strategies," Econometric Institute Research Papers EI 2007-34, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    8. Kress, Dominik & Pesch, Erwin, 2012. "Sequential competitive location on networks," European Journal of Operational Research, Elsevier, vol. 217(3), pages 483-499.
    9. Noga Alon & Michal Feldman & Ariel D. Procaccia & Moshe Tennenholtz, 2010. "Strategyproof Approximation of the Minimax on Networks," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 513-526, August.
    10. Stefano Vannucci, 2015. "Network geometry and the scope of the median voter theorem," Department of Economics University of Siena 704, Department of Economics, University of Siena.
    11. Berno Buechel, 2014. "Condorcet winners on median spaces," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(3), pages 735-750, March.

    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:eee:ejores:v:20:y:1985:i:3:p:314-326. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.