An average lexicographic value for cooperative games
From MaRDI portal
Publication:421596
DOI10.1016/j.ejor.2011.03.025zbMath1237.91032OpenAlexW2036291866MaRDI QIDQ421596
Edwin Lohmann, Marieke Quant, P. E. M. Borm, S. H. Tijs
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.03.025
Related Items
On the core and bargaining set of a veto game ⋮ On a class of vertices of the core ⋮ On the set of extreme core allocations for minimal cost spanning tree problems ⋮ Lexicographic allocations and extreme core payoffs: the case of assignment games ⋮ Stable and weakly additive cost sharing in shortest path problems ⋮ Whose deletion does not affect your payoff? The difference between the Shapley value, the egalitarian value, the solidarity value, and the Banzhaf value ⋮ Probabilistic resource pooling games ⋮ Hyperadditive games and applications to networks or matching problems ⋮ Undominated nonnegative excesses and core extensions of transferable utility games ⋮ A fast approach to compute fuzzy values of matrix games with payoffs of triangular fuzzy numbers ⋮ On the bankruptcy situations and the Alexia value ⋮ Weighted component fairness for forest games ⋮ The central core and the mid-central core as novel set-valued and point-valued solution concepts for transferable utility coalitional games ⋮ Interval-valued n-person Cooperative games with satisfactory degree constraints ⋮ The boundary of the core of a balanced game: face games ⋮ A new approach to agglomeration problems ⋮ Stable lexicographic rules for shortest path games ⋮ A matching value for cooperative games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Game theoretic analysis of a bankruptcy problem from the Talmud
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- A problem of rights arbitration from the Talmud
- Clan games
- Reexamination of the perfectness concept for equilibrium points in extensive games
- Additive stable solutions on perfect cones of cooperative games
- The core and the bargaining set in glove-market games
- A natural selection from the core of a TU game: the core-center
- Compromise solutions based on bankruptcy
- Cores of convex games
- Cores of exact games. I
- Simple flow games
- The core cover in relation to the nucleolus and the Weber set
- HOW TO HANDLE INTERVAL SOLUTIONS FOR COOPERATIVE INTERVAL GAMES
- SHARE OPPORTUNITY SETS AND COOPERATIVE GAMES
- Totally Balanced Games and Games of Flow
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- The Nucleolus of a Characteristic Function Game
- The Nucleolus as a Solution of a Minimization Problem
- Refinements of the Nash equilibrium concept
- A new solution to the random assignment problem.
