Characterizing convexity of games using marginal vectors
From MaRDI portal
Recommendations
Cites work
- A Simple Expression for the Shapley Value in a Special Case
- A quadratic programming model for product configuration optimization
- Convexity and marginal vectors
- Cores of convex games
- Even and odd marginal worth vectors, Owen's multilinear extension and convex games
- Game theoretic analysis of a bankruptcy problem from the Talmud
- How to handle interval solutions for cooperative interval games
- Naturally submodular digraphs and forbidden digraph configurations
- On the equivalence between some local and global Chinese postman and traveling salesman graphs
- Sequencing games
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- The kernel and bargaining set for convex games
- The kernel/nucleolus of a standard tree game
Cited in
(7)- Core-based criterion for extreme supermodular functions
- A note on external angles of the core of convex TU games, marginal worth vectors and the Weber set
- The cone of supermodular games on finite distributive lattices
- Strong convexity of NTU games
- C-complete sets for compromise stable games
- Some characterizations of convex games
- Even and odd marginal worth vectors, Owen's multilinear extension and convex games
This page was built for publication: Characterizing convexity of games using marginal vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887064)