An Axiomatic Approach to Location on Networks

DOI10.1287/MOOR.15.3.553MaRDI QIDQ3202132zbMATH OpenOpenAlexFDO

Authors 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

Discrete location and assignment (90B80) Continuous location (90B85) Programming involving graphs or networks (90C35) Cooperative games (91A12) Positional games (pursuit and evasion, etc.) (91A24) Other game-theoretic models (91A40)

Recommendations

• An axiomatic characterization of a class of locations in tree networks
• An Impossibility Result in Axiomatic Location Theory
• scientific article; zbMATH DE number 4003873
• An axiomatic characterization of some locations in trees
• The optimal location of a path or tree in a tree network

Cited in

(37)

• 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
• An axiomatic characterization of the position value for network situations
• Majority rule for profiles of arbitrary length, with an emphasis on the consistency axiom
• 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
• An axiomatic characterization of a class of locations in tree networks
• The _p-function on finite Boolean lattices
• The median function on trees
• An ABC-problem for location and consensus functions on graphs
• The median function on Boolean lattices
• Axiomatization and the antimean function on paths
• Axiomatic characterization of the mean function on trees
• scientific article; zbMATH DE number 3847184 (Why is no real title available?)
• scientific article; zbMATH DE number 1253064 (Why is no real title available?)
• The replacement principle for the provision of multiple public goods on tree networks
• A Computational Geometry Framework for Efficient Network Localization
• The \(\ell_{p}\)-function on trees
• Axiomatic characterization of the antimedian function on paths and hypercubes
• Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
• Five axioms for location functions on median graphs
• An axiomatization of the median procedure on the \(n\)-cube
• What do trees and hypercubes have in common?
• The median function of a block graph: axiomatic characterizations
• ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and \(G^2\)-connected medians
• Axioms for consensus functions on the \(n\)-cube
• Center function on book graphs -- axiomatic characterization
• Strategy-proof location on a network
• Axiomatic characterization of the center function on fan graphs
• Axiomatic characterization of the center function on crown graphs
• Axiomatic characterization of the center function on graphs with diameter two
• Efficient algorithms for network localization using cores of underlying graphs
• Axiomatic characterization of the median function of a block graph

This page was built for publication: An Axiomatic Approach to Location on Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3202132)