Strategy-Proof Location Functions on Finite Graphs

F. R. McMorris (), Henry Martyn Mulder () and Fred S. Roberts ()
Additional contact information
F. R. McMorris: Illinois Institute of Technology
Henry Martyn Mulder: Erasmus Universiteit
Fred S. Roberts: DIMACS Center, Rutgers University

A chapter in Clusters, Orders, and Trees: Methods and Applications, 2014, pp 63-75 from Springer

Abstract: 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.

Keywords: Location function; Center; Median; Strategy-proof (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4939-0742-7_4

Ordering information: This item can be ordered from
http://www.springer.com/9781493907427

DOI: 10.1007/978-1-4939-0742-7_4

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().