Stable source connection and assignment problems as multi-period shortest path problems
From MaRDI portal
Publication:6665449
DOI10.1007/S00182-024-00896-1MaRDI QIDQ6665449
Christian Trudeau, Leanne Streekstra
Publication date: 17 January 2025
Published in: International Journal of Game Theory (Search for Journal in Brave)
shortest pathcorecooperative gameassignmenttotal balancednessdemand over multiple periodssource-connection
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized three-sided assignment markets: core consistency and competitive prices
- Minimum cost arborescences
- Fair cost allocations under conflicts - a game-theoretic point of view -
- Network flow problems and permutationally concave games
- The core of an \(m\)-sided assignment game
- The supplier-firm-buyer game and its \(m\)-sided generalization
- Shared irrigation costs: An empirical and axiomatic analysis
- Minimarg and maximarg operators
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Minimum incoming cost rules for arborescences
- On the core of the minimum cost Steiner tree game in networks
- Analysis of the core of multisided Böhm-Bawerk assignment markets
- Shortest path games
- Stability and fairness in the job scheduling problem
- Stable lexicographic rules for shortest path games
- Monotonic games are spanning network games
- Congestion network problems and related games
- The vector lattice structure of the \(n\)-person TU games
- The assignment game. I: The core
- The Böhm-Bawerk horse market: a cooperative analysis
- Totally Balanced Games and Games of Flow
- On the core of linear production games
- On cost allocation for a spanning tree: A game theoretic approach
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)
