k-convexn-person games and their cores
From MaRDI portal
Publication:3731394
DOI10.1007/BF01918631zbMATH Open0597.90094OpenAlexW1983922614MaRDI QIDQ3731394FDOQ3731394
Authors: Theo S. H. Driessen
Publication date: 1986
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01918631
Recommendations
Cites Work
- Title not available (Why is that?)
- A Simple Expression for the Shapley Value in a Special Case
- Cores of convex games
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- Properties of 1-convex \(n\)-person games
- Title not available (Why is that?)
- Extreme games and their solutions
- Generalized k-quota solutions for (N,k) games
Cited In (23)
- Solution concepts of \(k\)-convex \(n\)-person games
- An algorithm to compute the average-of-awards rule for claims problems with an application to the allocation of \(\mathrm{CO}_2\) emissions
- Title not available (Why is that?)
- On the core, the Weber set and convexity in games with a priori unions
- Title not available (Why is that?)
- A behavioral foundation for fuzzy measures
- Games on fuzzy communication structures with Choquet players
- Convex decomposition of games and axiomatizations of the core and the D-core
- Set-valued TU-games
- Matrix analysis for associated consistency in cooperative game theory
- On the set of imputations induced by the \(k\)-additive core
- An extension of the \(\tau\)-value to games with coalition structures.
- On the vertices of the \(k\)-additive core
- Cores of convex games
- Title not available (Why is that?)
- A bankruptcy problem and an information trading problem: Applications tok-convex games
- Title not available (Why is that?)
- An axiomatization of the \(\tau\)-value
- A note on a core catcher of a cooperative game
- Characterizations ofk-Convex Games
- Bargaining property of nucleolus and \(\tau\)-value in a class of TU-games
- Tree enterprises and bankruptcy ventures. A game theoretic similarity due to a graph theoretic proof
- Onn-person game solutions and convex programs with essentially unconstrained duals1
This page was built for publication: k-convexn-person games and their cores
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3731394)