Fixed-Route Cost Allocation

DOI10.2307/2975572MaRDI QIDQ3662995zbMATH OpenOpenAlexFDO

Authors H. O. Pollak, Peter Fishburn

Publication date 1983

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2975572

zbMATH Keywords

axioms of fair allocation

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited in

(18)

• NTU PERT games
• On the core of routing games with revenues
• Traveling salesman games
• Traveling salesman games with the Monge property
• Cost allocation: The traveling salesman, bin packing, and the knapsack
• Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: the pollution routing game
• Core-based cost allocation in the cooperative traveling salesman problem
• Characterizing the Shapley value in fixed-route traveling salesman problems with appointments
• Operations research games: A survey. (With comments and rejoinder)
• The joint network vehicle routing game with optional customers
• Compromise values in cooperative game theory
• A review on cost allocation methods in collaborative transportation
• Proportional allocation schemes for tour costs
• Cooperation of customers in traveling salesman problems with profits
• A note on the 5-person traveling salesman game
• Fair cost allocation schemes
• Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
• On the core of routing games

This page was built for publication: Fixed-Route Cost Allocation

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