Computing an element in the lexicographic kernel of a game
From MaRDI portal
Recommendations
Cites work
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Convergent Transfer Schemes for N-Person Games
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1845876 (Why is no real title available?)
- Iterative processes with nucleolar restrictions
- Matching Games: The Least Core and the Nucleolus
- On the complexity of testing membership in the core of min-cost spanning tree games
- On the computation of the nucleolus of a cooperative game
- Stable Sets and Stable Points of Set-Valued Dynamic Systems with Applications to Game Theory
- The kernel of a cooperative game
- The Lexicographic Kernel of a Cooperative Game
- The Nucleolus of a Characteristic Function Game
Cited in
(2)
This page was built for publication: Computing an element in the lexicographic kernel of a game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474551)