A heuristic procedure for computing the nucleolus

DOI10.1016/J.COR.2019.104764zbMATH Open1458.91024OpenAlexW2966131349WikidataQ127393869 ScholiaQ127393869MaRDI QIDQ2329720FDOQ2329720

Authors: Federico Perea, Justo Puerto 

Publication date: 18 October 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.104764

Recommendations

• On finding the nucleolus of an \(n\)-person cooperative game
• Computing the Nucleolus by Solving a Prolonged Simplex Algorithm
• On the computation of the nucleolus of a cooperative game
• Finding the nucleoli of large cooperative games
• Finding the nucleolus of any \(n\)-person cooperative game by a single linear program

zbMATH Keywords

linear programminggame theoryheuristicnucleolus

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Cooperative games (91A12)

Cites Work

• A simple algorithm for the nucleolus of airport profit games
• Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
• A procedure for finding the nucleolus of a cooperativen person game
• Computing the Nucleolus by Solving a Prolonged Simplex Algorithm
• The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties
• Approximate nucleolus-based revenue sharing in airline alliances
• Computing the nucleolus of cyclic permutation games
• The \({\mathcal B}\)-nucleolus of TU-games
• A note on the nucleolus
• On the nucleolus of neighbor games
• Finding the nucleoli of large cooperative games
• Finding the nucleolus of any \(n\)-person cooperative game by a single linear program
• Game theory
• The Nucleolus as a Solution of a Minimization Problem
• Finding nucleolus of flow game
• On finding the nucleolus of an \(n\)-person cooperative game
• Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach
• Characterization sets for the nucleolus
• On the core and nucleolus of directed acyclic graph games
• A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure
• On the nucleolus of shortest path games
• The nucleolus of large majority games
• Common mistakes in computing the nucleolus
• The Least-Core and Nucleolus of Path Cooperative Games
• Computing the least-core and nucleolus for threshold cardinality matching games
• A procedure to compute the nucleolus of the assignment game
• Determining the nucleolus of compromise stable games
• The complexity of the nucleolus in compact games
• An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution
• The nucleolus of arborescence games in directed acyclic graphs
• The asymptotic core, nucleolus and Shapley value of smooth market games with symmetric large players

Cited In (6)

• Finding the nucleolus of the vehicle routing game with time windows
• Title not available (Why is that?)
• The least square nucleolus is a normalized Banzhaf value
• Title not available (Why is that?)
• TU-games with utilities: the prenucleolus and its characterization set
• On systems of quotas from bankruptcy perspective: the sampling estimation of the random arrival rule

This page was built for publication: A heuristic procedure for computing the nucleolus

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