An algorithm for finding the nucleolus of assignment games
From MaRDI portal
Publication:1327070
DOI10.1007/BF01240179zbMath0811.90128MaRDI QIDQ1327070
Tamás Solymosi, Thirukkannamangai E. S. Raghavan
Publication date: 7 May 1995
Published in: International Journal of Game Theory (Search for Journal in Brave)
Cooperative games (91A12) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Related Items (46)
Population monotonicity in matching games ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ Finding the nucleoli of large cooperative games ⋮ The Least-Core and Nucleolus of Path Cooperative Games ⋮ Core theory for multiple-sided assignment games ⋮ A simple procedure to compute the nucleolus of \(\Gamma\)-component additive games ⋮ On the complexity of nucleolus computation for bipartite \(b\)-matching games ⋮ Evolutionary dynamics and equitable core selection in assignment games ⋮ The nucleolus and the core-center of multi-sided Böhm-Bawerk assignment markets ⋮ Computing the least-core and nucleolus for threshold cardinality matching games ⋮ Characterization sets for the nucleolus in balanced games ⋮ Arboricity games: the core and the nucleolus ⋮ Stability and convergence in matching processes for shared mobility systems ⋮ Sensitivity of fair prices in assignment markets ⋮ A survey on assignment markets ⋮ The maximum and the addition of assignment games ⋮ Assignment markets with the same core ⋮ Fair cost allocations under conflicts - a game-theoretic point of view - ⋮ A procedure to compute the nucleolus of the assignment game ⋮ Computing solutions for matching games ⋮ Finding and verifying the nucleolus of cooperative games ⋮ Finding nucleolus of flow game ⋮ Simple games versus weighted voting games: bounding the critical threshold value ⋮ Does it make sense to analyse a two-sided market as a multi-choice game? ⋮ On the dimension of the core of the assignment game ⋮ An algorithm to compute the nucleolus of shortest path games ⋮ A note on assignment games with the same nucleolus ⋮ An axiomatization of the nucleolus of assignment markets ⋮ Computing the nucleolus of cyclic permutation games ⋮ The nucleolus of arborescence games in directed acyclic graphs ⋮ Weighted nucleoli and dually essential coalitions ⋮ Path cooperative games ⋮ Analytic solution for the nucleolus of a three-player cooperative game ⋮ Multi-sided assignment games on \(m\)-partite graphs ⋮ Computing the nucleolus of weighted cooperative matching games in polynomial time ⋮ Network strength games: the core and the nucleolus ⋮ On axiomatizations of the Shapley value for assignment games ⋮ The \({\mathcal B}\)-nucleolus of TU-games ⋮ ASSIGNMENT SITUATIONS WITH MULTIPLE OWNERSHIP AND THEIR GAMES ⋮ Network disconnection games: a game theoretic approach to checkpoint evaluation in networks ⋮ The Complexity of the Nucleolus in Compact Games ⋮ A glove-market partitioned matrix related to the assignment game ⋮ The general graph matching game: approximate core ⋮ On a variant of lexicographic multi-objective programming ⋮ Sharing costs in highways: a game theoretic approach ⋮ On the nucleolus of neighbor games
Cites Work
- On finding the nucleolus of an \(n\)-person cooperative game
- The general nucleolus and the reduced game property
- A note on the nucleolus
- The assignment game. I: The core
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- On Some Network Flow Games
- An algorithm for the determination of longest distances in a graph
- The Nucleolus of a Characteristic Function Game
- The Nucleolus as a Solution of a Minimization Problem
This page was built for publication: An algorithm for finding the nucleolus of assignment games
