Recommendations
Cites work
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 1929535 (Why is no real title available?)
- Cores of convex games
- Minimum cost spanning tree games
- On the core of information graph games
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- The assignment game. I: The core
Cited in
(17)- Characterization of the extreme core allocations of the assignment game.
- Assignment markets with the same core
- The boundary of the core of a balanced game: face games
- A survey on assignment markets
- Does it make sense to analyse a two-sided market as a multi-choice game?
- A simple procedure to obtain the extreme core allocations of an assignment market
- From the bankruptcy problem and its concede-and-divide solution to the assignment problem and its fair division solution
- On the set of extreme core allocations for minimal cost spanning tree problems
- Lexicographic allocations and extreme core payoffs: the case of assignment games
- ASSIGNMENT SITUATIONS WITH MULTIPLE OWNERSHIP AND THEIR GAMES
- Monotonic core allocation paths for assignment games
- Analysis of the core of multisided Böhm-Bawerk assignment markets
- Enforcing fair cooperation in production-inventory settings with heterogeneous agents
- Assortative multisided assignment games: the extreme core points
- Solving Becker's assortative assignments and extensions
- Core of the assignment game via fixed point methods
- On the nucleolus of neighbor games
This page was built for publication: Assignment games satisfy the CoMa-property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700114)