Pages that link to "Item:Q421596"
From MaRDI portal
The following pages link to An average lexicographic value for cooperative games (Q421596):
Displaying 18 items.
- On the core and bargaining set of a veto game (Q328547) (← links)
- Whose deletion does not affect your payoff? The difference between the Shapley value, the egalitarian value, the solidarity value, and the Banzhaf value (Q421791) (← links)
- Weighted component fairness for forest games (Q712475) (← links)
- The boundary of the core of a balanced game: face games (Q776857) (← links)
- On a class of vertices of the core (Q1651303) (← links)
- Undominated nonnegative excesses and core extensions of transferable utility games (Q1753572) (← links)
- On the bankruptcy situations and the Alexia value (Q1760852) (← links)
- Hyperadditive games and applications to networks or matching problems (Q1995312) (← links)
- The central core and the mid-central core as novel set-valued and point-valued solution concepts for transferable utility coalitional games (Q2019340) (← links)
- A new approach to agglomeration problems (Q2102826) (← links)
- A fast approach to compute fuzzy values of matrix games with payoffs of triangular fuzzy numbers (Q2253359) (← links)
- Interval-valued n-person Cooperative games with satisfactory degree constraints (Q2323440) (← links)
- Stable lexicographic rules for shortest path games (Q2345157) (← links)
- On the set of extreme core allocations for minimal cost spanning tree problems (Q2397642) (← links)
- Lexicographic allocations and extreme core payoffs: the case of assignment games (Q2400015) (← links)
- Probabilistic resource pooling games (Q4632990) (← links)
- A matching value for cooperative games (Q5273399) (← links)
- Stable and weakly additive cost sharing in shortest path problems (Q6146452) (← links)
