The following pages link to Sharing Supermodular Costs (Q3098296):
Displaying 10 items.
- Stochastic linear programming games with concave preferences (Q319166) (← links)
- Finding the nucleoli of large cooperative games (Q320842) (← links)
- Capacity allocation games without an initial sequence (Q1709948) (← links)
- Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games (Q2123122) (← links)
- Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner (Q2670475) (← links)
- Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation (Q2960364) (← links)
- Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation (Q4971567) (← links)
- An experiment on the Nash program: a comparison of two strategic mechanisms implementing the Shapley value (Q6176727) (← links)
- Algorithmic solutions for maximizing shareable costs (Q6659082) (← links)