Pages that link to "Item:Q2450756"
From MaRDI portal
The following pages link to A procedure to compute the nucleolus of the assignment game (Q2450756):
Displaying 12 items.
- A survey on assignment markets (Q908179) (← links)
- Computation of the nucleolus of some bilateral market games (Q1096553) (← links)
- An algorithm for finding the nucleolus of assignment games (Q1327070) (← links)
- Computing the nucleolus of some combinatorially-structured games. (Q1587940) (← links)
- The nucleolus and the core-center of multi-sided Böhm-Bawerk assignment markets (Q1935926) (← links)
- A note on assignment games with the same nucleolus (Q2001861) (← links)
- Does it make sense to analyse a two-sided market as a multi-choice game? (Q2241239) (← links)
- An axiomatization of the nucleolus of assignment markets (Q2259410) (← links)
- Multi-sided assignment games on \(m\)-partite graphs (Q2288857) (← links)
- A heuristic procedure for computing the nucleolus (Q2329720) (← links)
- A note on the nucleolus of assignment games. (Q2753323) (← links)
- Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation (Q2960364) (← links)