IDEAS home Printed from https://ideas.repec.org/p/ems/eureir/7890.html
   My bibliography  Save this paper

Axiomatic characterization of the absolute median on cube-free median networks

Author

Listed:
  • Mulder, H.M.
  • Vohra, R.V.

Abstract

In Vohra, European J. Operational Research 90 (1996) 78 – 84, a characterization of the absolute median of a tree network using three simple axioms is presented. This note extends that result from tree networks to cube-free median networks. A special case of such networks is the grid structure of roads found in cities equipped with the Manhattan metric.

Suggested Citation

  • 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.
    • Handle: RePEc:ems:eureir:7890
    as

    Download full text from publisher

    File URL: https://repub.eur.nl/pub/7890/ei2006-26.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. labbe, M. & Peeters, D. & Thisse, J.F., 1992. "Location on Networks," Papers 9216, Universite Libre de Bruxelles - C.E.M.E..
    2. Ron Holzman, 1990. "An Axiomatic Approach to Location on Networks," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 553-563, August.
    3. Vohra, Rakesh, 1996. "An axiomatic characterization of some locations in trees," European Journal of Operational Research, Elsevier, vol. 90(1), pages 78-84, April.
    4. Young, H. P., 1974. "An axiomatization of Borda's rule," Journal of Economic Theory, Elsevier, vol. 9(1), pages 43-52, September.
    5. Bandelt, Hans-Jurgen, 1985. "Networks with condorcet solutions," European Journal of Operational Research, Elsevier, vol. 20(3), pages 314-326, June.
    6. repec:cor:louvrp:-730 is not listed on IDEAS
    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. Mulder, H.M. & Novick, B., 2011. "A simple axiomatization of the median procedure on median graphs," Econometric Institute Research Papers EI2011-25, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. McMorris, F.R. & Mulder, H.M. & Ortega, O., 2010. "Axiomatic Characterization of the Mean Function on Trees," Econometric Institute Research Papers EI 2010-07, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. McMorris, F.R. & Mulder, Henry Martyn & Novick, Beth & Powers, Robert C., 2021. "Majority rule for profiles of arbitrary length, with an emphasis on the consistency axiom," Mathematical Social Sciences, Elsevier, vol. 109(C), pages 164-174.
    4. Dean P. Foster & Rakesh V. Vohra, 1998. "An Axiomatic Characterization of a Class of Locations in Tree Networks," Operations Research, INFORMS, vol. 46(3), pages 347-354, June.
    5. McMorris, F.R. & Novick, B. & Mulder, H.M. & Powers, R.C., 2015. "An ABC-Problem for Location and Consensus Functions on Graphs," Econometric Institute Research Papers EI 2015-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. Masashi Umezawa, 2012. "The replacement principle for the provision of multiple public goods on tree networks," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(2), pages 211-235, February.
    7. Changat, M. & Lekha, D.S. & Mulder, H.M. & Subhamathi, A.R., 2014. "Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs," Econometric Institute Research Papers EI 2014-31, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    8. McMorris, F.R. & Mulder, H.M. & Novick, B. & Powers, R.C., 2014. "Five axioms for location functions on median graphs," Econometric Institute Research Papers EI 2014-10, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    9. Herman Monsuur & Ton Storcken, 2004. "Centers in Connected Undirected Graphs: An Axiomatic Approach," Operations Research, INFORMS, vol. 52(1), pages 54-64, February.
    10. Balakrishnan, K. & Changat, M. & Mulder, H.M. & Subhamathi, A.R., 2011. "Axiomatic Characterization of the Antimedian Function on Paths and Hypercubes," Econometric Institute Research Papers EI 2011-08, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    11. 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.
    12. Changat, M. & Lekha, D.S. & Mohandas, S. & Mulder, H.M. & Subhamathi, A.R., 2015. "Axiomatic Characterization of the Median and Antimedian Function on a Complete Graph minus a Matching," Econometric Institute Research Papers EI2015-17, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    13. de Palma, André & Lindsey, Robin, 2001. "Optimal timetables for public transportation," Transportation Research Part B: Methodological, Elsevier, vol. 35(8), pages 789-813, September.
    14. Bock, Hans-Hermann & Day, William H. E. & McMorris, F. R., 1998. "Consensus rules for committee elections," Mathematical Social Sciences, Elsevier, vol. 35(3), pages 219-232, May.
    15. Le Breton, Michel & Truchon, Michel, 1997. "A Borda measure for social choice functions," Mathematical Social Sciences, Elsevier, vol. 34(3), pages 249-272, October.
    16. Brandt, Felix & Saile, Christian & Stricker, Christian, 2022. "Strategyproof social choice when preferences and outcomes may contain ties," Journal of Economic Theory, Elsevier, vol. 202(C).
    17. Burak Can & Peter Csoka & Emre Ergin, 2017. "How to choose a non-manipulable delegation?," CERS-IE WORKING PAPERS 1713, Institute of Economics, Centre for Economic and Regional Studies.
    18. Núñez, Matías & Sanver, M. Remzi, 2017. "Revisiting the connection between the no-show paradox and monotonicity," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 9-17.
    19. Merlin, Vincent & Valognes, Fabrice, 2004. "The impact of indifferent voters on the likelihood of some voting paradoxes," Mathematical Social Sciences, Elsevier, vol. 48(3), pages 343-361, November.
    20. Battal Doğan & Semih Koray, 2015. "Maskin-monotonic scoring rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(2), pages 423-432, February.

    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:ems:eureir:7890. 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: RePub (email available below). General contact details of provider: https://edirc.repec.org/data/feeurnl.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.