An Axiomatic Approach to Location on Networks

DOI10.1287/moor.15.3.553zbMath0715.90070MaRDI QIDQ3202132

Ron Holzman

Publication date: 1990

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.15.3.553

zbMATH Keywords

tree-network

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B85: Continuous location

91A12: Cooperative games

91A40: Other game-theoretic models

90B80: Discrete location and assignment

91A24: Positional games (pursuit and evasion, etc.)

Related Items

The ℓ_p‐function on trees, AXIOMATIC CHARACTERIZATION OF THE ANTIMEDIAN FUNCTION ON PATHS AND HYPERCUBES, Five axioms for location functions on median graphs, What Do Trees and Hypercubes Have in Common?, An ABC-problem for location and consensus functions on graphs, The replacement principle for the provision of multiple public goods on tree networks, An axiomatization of the median procedure on the \(n\)-cube, Axioms for consensus functions on the \(n\)-cube, An axiomatic characterization of some locations in trees, Some personal views on the current state and the future of locational analysis, The replacement principle and tree structured preferences, A double annealing algorithm for discrete location/allocation problems, Axiomatic characterization of the center function. The case of non-universal axioms, Axiomatic characterization of the center function. the case of universal axioms, Axiomatic characterization of the median and antimedian function on a complete graph minus a matching, The center function on trees, The ℓp-function on finite Boolean lattices, THE MEDIAN FUNCTION ON TREES, The median function on Boolean lattices, Axiomatization and the antimean function on paths, AXIOMATIC CHARACTERIZATION OF THE MEAN FUNCTION ON TREES