Strategy-proof location functions on finite graphs

F. R. McMorris, Henry Martyn Mulder, Fred S. Roberts

Research output: Chapter in Book/Report/Conference proceedingChapter

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.

Original languageEnglish (US)
Title of host publicationSpringer Optimization and Its Applications
PublisherSpringer International Publishing
Pages63-75
Number of pages13
DOIs
StatePublished - 2014

Publication series

NameSpringer Optimization and Its Applications
Volume92
ISSN (Print)1931-6828
ISSN (Electronic)1931-6836

All Science Journal Classification (ASJC) codes

  • Control and Optimization

Keywords

  • Center
  • Location function
  • Median
  • Strategy-proof

Fingerprint

Dive into the research topics of 'Strategy-proof location functions on finite graphs'. Together they form a unique fingerprint.

Cite this