Márton Benedek (KRTK, Corvinus University) will present “Computing the nucleolus of cooperative games” on October 7th, 2024, at 10:30 AM, in room QA406.
Abstract:
The nucleolus offers a desirable payoff-sharing solution in cooperative games, thanks to its attractive properties—it always exists and lies in the core (if the core is nonempty), and it is unique. The nucleolus is considered as the most ‘stable’ solution in the sense that it lexicographically minimizes the dissatisfactions among all coalitions. In this talk we are focusing on the different computation methods of the nucleolus: the traditionally most widely employed scheme using a sequence of linear programs (LPs), as well as less traditional methods, such as single-LP and nonlinear approaches, and the state-of-the-art lexicographical descent method. We will also focus on the role of characterization sets, and briefly discuss some of the recent applications.