Pages that link to "Item:Q1403160"
From MaRDI portal
The following pages link to Note on the computational complexity of least core concepts for min-cost spanning tree games. (Q1403160):
Displaying 7 items.
- Fair ticket pricing in public transport as a constrained cost allocation game (Q2341202) (← links)
- Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
- On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
- Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation (Q2960364) (← links)
- The least square B-nucleolus for fuzzy cooperative games (Q2988439) (← links)
- Algorithmic Cost Allocation Games: Theory and Applications (Q5176374) (← links)
- Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)
