The Nucleolus as a Solution of a Minimization Problem

Cited in

(28)

Finding the nucleolus of the vehicle routing game with time windows
Characterizations of the \(\mathbf{u}\)-prenucleolus by dually-\(\mathbf{u}\)-essential coalitions
Computation of the nucleolus of some bilateral market games
Finding and verifying the nucleolus of cooperative games
Analytic solution for the nucleolus of a three-player cooperative game
A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
A heuristic procedure for computing the nucleolus
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
An algorithm for finding the nucleolus of assignment games
Iterative processes with nucleolar restrictions
The complexity of the nucleolus in compact games
The nucleolus is well-posed
Lexicographic optimality in the multiple objective linear programming: The nucleolar solution
Constructive and blocking power in collaborative transportation
Finding the nucleoli of large cooperative games
Finding the nucleolus of any n-person cooperative game by a single linear program
An average lexicographic value for cooperative games
The range of the efficient frontier in multiple objective linear programming
On finding the nucleolus of an n-person cooperative game
On the coincidence of the prenucleolus and the Shapley value
Some recent results inn-person game theory
Reducing the number of linear programs needed for solving the nucleolus problem of n-person game theory
Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
A note on the nucleolus
TU-games with utilities: the prenucleolus and its characterization set
Game theoretic analysis of a bankruptcy problem from the Talmud
An LP approach to compute the pre-kernel for cooperative games
On a variant of lexicographic multi-objective programming

This page was built for publication: The Nucleolus as a Solution of a Minimization Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5655210)