Preconvex games
From MaRDI portal
Cites work
- A new axiomatization of the Shapley value
- Cores of convex games
- scientific article; zbMATH DE number 1929535 (Why is no real title available?)
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- Hyperadditive games and applications to networks or matching problems
- Marginal Contributions and Externalities in the Value
- Monotonic solutions of cooperative games
- On extreme points of the core and reduced games
- On Groves mechanisms for costly inclusion
- On the bargaining set, kernel and core of superadditive games
- On the core and bargaining set of a veto game
- Queueing games with an endogenous number of machines
- Stable cost sharing in production allocation games
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- The kernel of a cooperative game
- The Nucleolus of a Characteristic Function Game
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
- The Shapley value and average convex games
- Weighted average-convexity and Shapley values
This page was built for publication: Preconvex games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880934)