A bankruptcy problem and an information trading problem: Applications tok-convex games
From MaRDI portal
Publication:4845142
DOI10.1007/BF01432362zbMath0837.90129OpenAlexW2052925371MaRDI QIDQ4845142
Publication date: 4 September 1995
Published in: [https://portal.mardi4nfdi.de/entity/Q4289815 ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research] (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01432362
Related Items
Tree enterprises and bankruptcy ventures. A game theoretic similarity due to a graph theoretic proof, Convexity properties for interior operator games, Characterizations ofk-Convex Games
Cites Work
- Information market games
- Game theoretic analysis of a bankruptcy problem from the Talmud
- Solution concepts of \(k\)-convex \(n\)-person games
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- A problem of rights arbitration from the Talmud
- Cooperative games with large cores
- Population monotonic allocation schemes for cooperative games with transferable utility
- The Shapley value and average convex games
- Cores of convex games
- k-convexn-person games and their cores
- A quadratic programming model for product configuration optimization
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
- A Simple Expression for the Shapley Value in a Special Case
- Activity selection games and the minimum‐cut problem
- Unnamed Item
- Unnamed Item
- Unnamed Item