Pages that link to "Item:Q2757577"
From MaRDI portal
The following pages link to On computing the nucleolus of a balanced connected game (Q2757577):
Displaying 16 items.
- A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure (Q637584) (← links)
- On the nucleolus of shortest path games (Q681844) (← links)
- Computing the nucleolus of cyclic permutation games (Q707152) (← links)
- The integer nucleolus of directed simple games: a characterization and an algorithm (Q725102) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Operations research games: A survey. (With comments and rejoinder) (Q1348703) (← links)
- Computing the nucleolus of some combinatorially-structured games. (Q1587940) (← links)
- Allocating the cost of congestion with the nucleolus (Q1768379) (← links)
- On the nucleolus of neighbor games (Q1869507) (← links)
- Finding the nucleolus of the vehicle routing game with time windows (Q1988954) (← links)
- An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
- A procedure to compute the nucleolus of the assignment game (Q2450756) (← links)
- Core stability in chain-component additive games (Q2483120) (← links)
- A simple algorithm for the nucleolus of airport profit games (Q2501071) (← links)
- The complexity of the nucleolus in compact games (Q2828226) (← links)
- SIMPLICIAL ALGORITHM FOR COMPUTING A CORE ELEMENT IN A BALANCED GAME (Q3991644) (← links)
