A bankruptcy problem and an information trading problem: Applications tok-convex games
From MaRDI portal
Publication:4845142
Recommendations
Cites work
- scientific article; zbMATH DE number 19353 (Why is no real title available?)
- scientific article; zbMATH DE number 41329 (Why is no real title available?)
- scientific article; zbMATH DE number 592624 (Why is no real title available?)
- A Simple Expression for the Shapley Value in a Special Case
- A problem of rights arbitration from the Talmud
- A quadratic programming model for product configuration optimization
- Activity selection games and the minimum‐cut problem
- Cooperative games with large cores
- Cores of convex games
- Game theoretic analysis of a bankruptcy problem from the Talmud
- Information market games
- Population monotonic allocation schemes for cooperative games with transferable utility
- Solution concepts of \(k\)-convex \(n\)-person games
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
- The Shapley value and average convex games
- k-convexn-person games and their cores
Cited in
(4)
This page was built for publication: A bankruptcy problem and an information trading problem: Applications tok-convex games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845142)