The University of Southampton
University of Southampton Institutional Repository

Computing the nucleolus of cooperative games

Computing the nucleolus of cooperative games
Computing the nucleolus of cooperative games
The computation of the nucleolus, one of the most widespread single valued solution concept of cooperative game theory has developed greatly, starting from an immensely complex lexicographical optimisation problem to solving a sequence of LPs. Focusing on the general case, in this thesis we provide an extensive review of the various existing computational methods in the literature, also providing a categorisation of these methods in a new aspect, mainly based on the process of updating in between LPs, that influences the required number of iterations. The disparity in the number of iterations between primal and dual methods lead to the classical primal-dual trade-off: one method requires minimal number of iterations (primal), while solving the large LPs in the other is easier (dual). We introduce a hybrid variant, that inherits good qualities from each method, dissolving the classical trade-off. After showing how to reduce the number of iterations for the dual sequence, we introduce a conceptually new, practical approach to one of the main tasks involved in the sequential LP framework, that is finding all coalitions in the span of some coalitions. We argue that it could be beneficial in practice not to do this, possibly leading to a decrease in computational time despite the increasing number of iterations, pivots and subroutine iterations. Through analysing the numerical results, it becomes clear, that the literature not yet considered every aspect of the primal-dual trade-off: namely warm starting, favouring primal over the dual. Balancedness is related to the nucleolus early on through the Kohlberg criterion verifying whether a solution is the nucleolus or not. Our results on balancedness lay the foundations for the main contribution of the thesis, a new constructive approach to compute the nucleolus. A primal based active-set method with a dual subroutine, that benefits from every advantage of primal methods, including efficient warm starting, however it does not suffer from it’s disadvantage, by solving large LPs without explicitly formulating them. Results on balancedness further allow us to improve on the original Kohlberg criterion. The new active-set method outperforms other classical sequential LP models and the dual counterpart of the proposed method, based on extensive amount of numerical testing. Another important contribution is providing open-source codes for all algorithms and instances involved in creating those numerical results.
University of Southampton
Benedek, Marton
72bc97bc-a373-4b88-9e9f-145d62551214
Benedek, Marton
72bc97bc-a373-4b88-9e9f-145d62551214
Fliege, Joerg
54978787-a271-4f70-8494-3c701c893d98

Benedek, Marton (2019) Computing the nucleolus of cooperative games. University of Southampton, Doctoral Thesis, 128pp.

Record type: Thesis (Doctoral)

Abstract

The computation of the nucleolus, one of the most widespread single valued solution concept of cooperative game theory has developed greatly, starting from an immensely complex lexicographical optimisation problem to solving a sequence of LPs. Focusing on the general case, in this thesis we provide an extensive review of the various existing computational methods in the literature, also providing a categorisation of these methods in a new aspect, mainly based on the process of updating in between LPs, that influences the required number of iterations. The disparity in the number of iterations between primal and dual methods lead to the classical primal-dual trade-off: one method requires minimal number of iterations (primal), while solving the large LPs in the other is easier (dual). We introduce a hybrid variant, that inherits good qualities from each method, dissolving the classical trade-off. After showing how to reduce the number of iterations for the dual sequence, we introduce a conceptually new, practical approach to one of the main tasks involved in the sequential LP framework, that is finding all coalitions in the span of some coalitions. We argue that it could be beneficial in practice not to do this, possibly leading to a decrease in computational time despite the increasing number of iterations, pivots and subroutine iterations. Through analysing the numerical results, it becomes clear, that the literature not yet considered every aspect of the primal-dual trade-off: namely warm starting, favouring primal over the dual. Balancedness is related to the nucleolus early on through the Kohlberg criterion verifying whether a solution is the nucleolus or not. Our results on balancedness lay the foundations for the main contribution of the thesis, a new constructive approach to compute the nucleolus. A primal based active-set method with a dual subroutine, that benefits from every advantage of primal methods, including efficient warm starting, however it does not suffer from it’s disadvantage, by solving large LPs without explicitly formulating them. Results on balancedness further allow us to improve on the original Kohlberg criterion. The new active-set method outperforms other classical sequential LP models and the dual counterpart of the proposed method, based on extensive amount of numerical testing. Another important contribution is providing open-source codes for all algorithms and instances involved in creating those numerical results.

Text
Final thesis - Version of Record
Available under License University of Southampton Thesis Licence.
Download (898kB)

More information

Published date: December 2019

Identifiers

Local EPrints ID: 438621
URI: http://eprints.soton.ac.uk/id/eprint/438621
PURE UUID: 24032f0f-654e-4f3a-bc23-5c9dfee16ae1
ORCID for Joerg Fliege: ORCID iD orcid.org/0000-0002-4459-5419

Catalogue record

Date deposited: 18 Mar 2020 17:36
Last modified: 17 Mar 2024 05:17

Export record

Contributors

Author: Marton Benedek
Thesis advisor: Joerg Fliege ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×