Pages that link to "Item:Q1278742"
From MaRDI portal
The following pages link to Reducing the number of linear programs needed for solving the nucleolus problem of \(n\)-person game theory (Q1278742):
Displayed 10 items.
- Finding the nucleoli of large cooperative games (Q320842) (← links)
- Optimal coalition formation and surplus distribution: two sides of one coin (Q420874) (← links)
- Characterization sets for the nucleolus in balanced games (Q1694788) (← links)
- Finding the nucleolus of the vehicle routing game with time windows (Q1988954) (← links)
- Common mistakes in computing the nucleolus (Q2629740) (← links)
- A review on cost allocation methods in collaborative transportation (Q2811933) (← links)
- The least square B-nucleolus for fuzzy cooperative games (Q2988439) (← links)
- Analytic solution for the nucleolus of a three-player cooperative game (Q3065628) (← links)
- Fast computation of the leastcore and prenucleolus of cooperative games (Q3598039) (← links)
- Constructive and blocking power in collaborative transportation (Q5964845) (← links)