Characterizing convexity of games using marginal vectors
From MaRDI portal
Publication:1887064
DOI10.1016/j.dam.2004.01.002zbMath1091.91007OpenAlexW2139919496MaRDI QIDQ1887064
Herbert Hamers, Bas van Velzen, Henk Norde
Publication date: 23 November 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/3fadf1f5-5571-4720-a6be-5c3d8e9c9d43
Related Items (3)
Core-based criterion for extreme supermodular functions ⋮ C-complete sets for compromise stable games ⋮ The cone of supermodular games on finite distributive lattices
Cites Work
- Game theoretic analysis of a bankruptcy problem from the Talmud
- Sequencing games
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- Convexity and marginal vectors
- On the equivalence between some local and global Chinese postman and traveling salesman graphs
- Even and odd marginal worth vectors, Owen's multilinear extension and convex games
- The kernel/nucleolus of a standard tree game
- Naturally submodular digraphs and forbidden digraph configurations
- Cores of convex games
- The kernel and bargaining set for convex games
- HOW TO HANDLE INTERVAL SOLUTIONS FOR COOPERATIVE INTERVAL GAMES
- A quadratic programming model for product configuration optimization
- A Simple Expression for the Shapley Value in a Special Case
This page was built for publication: Characterizing convexity of games using marginal vectors
