On the Core of Cost Allocation Games Defined on Location Problems

DOI10.1287/trsc.27.1.81zbMath0805.90126OpenAlexW2152869731MaRDI QIDQ5285895

Arie Tamir

Publication date: 29 June 1993

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.27.1.81

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Cooperative games (91A12) Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (14)

Stability and fairness in models with a multiple membership ⋮ The complexity of egalitarian mechanisms for linear programming games ⋮ Allocating costs in set covering problems ⋮ Strategic cooperation in cost sharing games ⋮ Cooperative location games based on the minimum diameter spanning Steiner subgraph problem ⋮ Voluntary formation of communities for the provision of public projects. ⋮ Locational analysis ⋮ A note on maximal covering location games ⋮ Dominating set games. ⋮ Integrated market selection and production planning: complexity and solution approaches ⋮ Collaborative transportation with overlapping coalitions ⋮ Production-inventory games: A new class of totally balanced combinatorial optimization games ⋮ Traveling salesman games with the Monge property ⋮ OPEN PROBLEMS IN COOPERATIVE LOCATION GAMES

This page was built for publication: On the Core of Cost Allocation Games Defined on Location Problems