Stable source connection and assignment problems as multi-period shortest path problems

DOI10.1007/S00182-024-00896-1MaRDI QIDQ6665449zbMATH OpenFDO

Authors Leanne Streekstra, Christian Trudeau

Publication date 17 January 2025

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00182-024-00896-1

zbMATH Keywords

assignmentcooperative gamecoredemand over multiple periodsshortest pathsource-connectiontotal balancedness

Mathematics Subject Classification ID

Game theory (91Axx)

Recommendations

• Cost allocation in shortest path games
• Stable and weakly additive cost sharing in shortest path problems
• On shortest path games
• A new rule for source connection problems
• Shortest path games

Cites work

• Analysis of the core of multisided Böhm-Bawerk assignment markets
• Congestion network problems and related games
• Fair cost allocations under conflicts - a game-theoretic point of view -
• Generalized three-sided assignment markets: core consistency and competitive prices
• scientific article; zbMATH DE number 3728058 (Why is no real title available?)
• scientific article; zbMATH DE number 1929535 (Why is no real title available?)
• Minimarg and maximarg operators
• Minimum cost arborescences
• Minimum cost spanning tree games and population monotonic allocation schemes.
• Minimum incoming cost rules for arborescences
• Monotonic games are spanning network games
• Network flow problems and permutationally concave games
• On cost allocation for a spanning tree: A game theoretic approach
• On the core of linear production games
• On the core of the minimum cost Steiner tree game in networks
• Shared irrigation costs: An empirical and axiomatic analysis
• Shortest path games
• Stability and fairness in the job scheduling problem
• Stable lexicographic rules for shortest path games
• The assignment game. I: The core
• The Böhm-Bawerk horse market: a cooperative analysis
• The core of an m-sided assignment game
• The supplier-firm-buyer game and its m-sided generalization
• The vector lattice structure of the n-person TU games
• Totally Balanced Games and Games of Flow

This page was built for publication: Stable source connection and assignment problems as multi-period shortest path problems

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