Strategy-proof location functions on finite graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 1339499 (Why is no real title available?)
- scientific article; zbMATH DE number 2182815 (Why is no real title available?)
- Locating libraries on a street
- Strategy-proof location on a network
- Strategy-proofness of the plurality rule over restricted domains
- Strategyproof approximation of the minimax on networks
- The center function on trees
- The median function on distributive semilattices
- The median procedure on median graphs
- The structure of median graphs
- The structure of non-manipulable social choice rules on a tree
Cited in
(7)- Pareto optimality, anonymity, and strategy-proofness in location problems
- Strategy-proof location of a public bad on a disc
- An ABC-problem for location and consensus functions on graphs
- False-name-proof facility location on discrete structures
- Generalized target functions on trees
- Strategy-proof location on a network
- The target location function on finite trees
This page was built for publication: Strategy-proof location functions on finite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270615)