Strategy-Proof Location Functions on Finite Graphs
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.
KeywordsLocation function Center Median Strategy-proof
Fred Roberts thanks the National Science Foundation for support under grant SES-1024722 to Rutgers University and the Department of Homeland Security for support under award 2009-ST-061-CCI002-04 to Rutgers University.
- 10.Mulder, H.M.: The Interval Function of a Graph, Mathematical Centre Tracts 132. Mathematisch Centrum, Amsterdam (1980)Google Scholar