Solution concepts of k-convex n-person games
From MaRDI portal
DOI10.1007/BF01769385zbMATH Open0633.90097OpenAlexW2496445699MaRDI QIDQ1096552FDOQ1096552
Authors: Theo S. H. Driessen
Publication date: 1986
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01769385
Recommendations
kernelcorenucleolusShapley value\(\tau\)-valuebargaining setgeometrical propertiesprekernel\(k\)-convex game
Cites Work
- A Simple Expression for the Shapley Value in a Special Case
- The Nucleolus of a Characteristic Function Game
- Cores of convex games
- The kernel and bargaining set for convex games
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- Title not available (Why is that?)
- The kernel of a cooperative game
- On the Nucleolus of a Characteristic Function Game
- A characterization, existence proof and dimension bounds for the kernel of a game
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- The \(\tau\)-value, the core and semiconvex games
- Cores of exact games. I
- Properties of 1-convex \(n\)-person games
- The inequalities that determine the bargaining set \({\mathcal M}_ 1^ {(1)}\).
- The Structure of the Kernel of a Cooperative Game
- Title not available (Why is that?)
- k-convexn-person games and their cores
- Generalized k-quota solutions for (N,k) games
Cited In (11)
- Nash equilibria in a model of multiproduct price competition: an assignment problem
- Static game theory models and their applications in management science
- The Shapley value and average convex games
- On the contribution of an additional player to a convex game
- A necessary and sufficient condition for the convexity in oligopoly games
- A bankruptcy problem and an information trading problem: Applications tok-convex games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characterizations ofk-Convex Games
- Extensions of solution concepts by means of muliplicative \(\epsilon\)-tax games
- Onn-person game solutions and convex programs with essentially unconstrained duals1
This page was built for publication: Solution concepts of \(k\)-convex \(n\)-person games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096552)