IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4939-0742-7_4.html
   My bibliography  Save this book chapter

Strategy-Proof Location Functions on Finite Graphs

In: Clusters, Orders, and Trees: Methods and Applications

Author

Listed:
  • F. R. McMorris

    (Illinois Institute of Technology
    University of Louisville)

  • Henry Martyn Mulder

    (Erasmus Universiteit)

  • Fred S. Roberts

    (DIMACS Center, Rutgers University)

Abstract

A location function on a finite graph takes a set of most preferred locations (vertices of the graph) for a set of users, and returns a set of locations satisfying conditions meant to please the entire user set as much as possible. A strategy-proof location function is one for which it never benefits a user to report a suboptimal preferred location. We introduce four versions of strategy-proof and prove some preliminary results focusing on two well-known location functions, the median and the center.

Suggested Citation

  • F. R. McMorris & Henry Martyn Mulder & Fred S. Roberts, 2014. "Strategy-Proof Location Functions on Finite Graphs," Springer Optimization and Its Applications, in: Fuad Aleskerov & Boris Goldengorin & Panos M. Pardalos (ed.), Clusters, Orders, and Trees: Methods and Applications, edition 127, pages 63-75, Springer.
    • Handle: RePEc:spr:spochp:978-1-4939-0742-7_4
    DOI: 10.1007/978-1-4939-0742-7_4
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spochp:978-1-4939-0742-7_4. 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: 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.