Characterization sets for the nucleolus in balanced games
From MaRDI portal
Publication:1694788
DOI10.1016/j.orl.2016.05.014zbMath1380.91019OpenAlexW2416389285MaRDI QIDQ1694788
Tamás Solymosi, Balázs R. Sziklai
Publication date: 6 February 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/39796/1/Char_Set_ORL_reduc.pdf
Related Items (7)
Sharing loading costs for multi compartment vehicles ⋮ On the complexity of nucleolus computation for bipartite \(b\)-matching games ⋮ Finding and verifying the nucleolus of cooperative games ⋮ On the core and nucleolus of directed acyclic graph games ⋮ An algorithm to compute the nucleolus of shortest path games ⋮ Facets of the cone of totally balanced games ⋮ Weighted nucleoli and dually essential coalitions
Cites Work
- Unnamed Item
- Unnamed Item
- Autonomous coalitions
- Finding the nucleolus of any \(n\)-person cooperative game by a single linear program
- The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties
- On finding the nucleolus of an \(n\)-person cooperative game
- On core stability, vital coalitions, and extendability
- Game theoretic analysis of a bankruptcy problem from the Talmud
- The general nucleolus and the reduced game property
- A characterization of the nucleolus for convex games
- The \({\mathcal B}\)-nucleolus of TU-games
- Reducing the number of linear programs needed for solving the nucleolus problem of \(n\)-person game theory
- An algorithm for finding the nucleolus of assignment games
- On the nucleolus of the basic vehicle routing game
- Characterization sets for the nucleolus
- Computing the nucleolus of min-cost spanning tree games is NP-hard.
- On the computational complexity of weighted voting games
- Strongly essential coalitions and the nucleolus of peer group games
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- A Simple Expression for the Shapley Value in a Special Case
- Game theoretic analysis of maximum cooperative purchasing situations
- Computing the Nucleolus by Solving a Prolonged Simplex Algorithm
- The Nucleolus of a Characteristic Function Game
- On the Nucleolus of a Characteristic Function Game
- Nucleoluses of Compound Simple Games
- Matching Games: The Least Core and the Nucleolus
- Finding nucleolus of flow game
- The core and nucleolus of games: a note on a paper by Göthe-Lundgren et al.
This page was built for publication: Characterization sets for the nucleolus in balanced games
