Arbitration, fairness and stability

We study the problem of dividing revenue among several collaborative entities. In our setting, each player possesses a nite amount of some divisible resource, and may allocate parts of his resource in order to work on various projects. Having completed tasks and generated pro ts, players must ag...

Full description

Saved in:
Bibliographic Details
Main Author: Yair Zick
Other Authors: School of Physical and Mathematical Sciences
Format: Theses and Dissertations
Language:English
Published: 2014
Subjects:
Online Access:https://hdl.handle.net/10356/60824
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-60824
record_format dspace
spelling sg-ntu-dr.10356-608242023-03-01T00:01:21Z Arbitration, fairness and stability Yair Zick School of Physical and Mathematical Sciences Edith Elkind DRNTU::Science::Mathematics::Discrete mathematics::Algorithms We study the problem of dividing revenue among several collaborative entities. In our setting, each player possesses a nite amount of some divisible resource, and may allocate parts of his resource in order to work on various projects. Having completed tasks and generated pro ts, players must agree on some way of dividing pro ts among them. Using the overlapping coalition formation (OCF) model proposed by Chalkiadakis et al. [2010] as the basis of our work, we develop a model for handling deviation in OCF games. Using our framework, which we term arbitration functions, we propose several new solution concepts for OCF games. In the rst part of this thesis, we analyze the arbitrated core of an OCF game; we show some necessary and su cient conditions for the non-emptiness of some arbitrated cores, and explore methods for computing outcomes in the core of an OCF game. Next, we describe and analyze the arbitrated nucleolus, bargaining set and two notions of a value for OCF games. All of the solution concepts we propose draw strong similarities to their non-OCF counterparts, and in fact contain the classic cooperative solution concepts as a special case. We conclude this thesis by proposing a solution concept for OCF (and non-OCF) cooperative settings that is based on a natural revenue allocation dynamic. In our setting, player revenue in time t acts as his available resources at time t + 1. Assuming that players are not myopic and care about their long-term rewards, we show that under certain conditions, players' incentives become aligned with what is socially optimal. In other words, choosing a payo division that maximizes long-term social welfare will be agreeable for all players. Doctor of Philosophy (SPMS) 2014-06-02T01:32:02Z 2014-06-02T01:32:02Z 2014 2014 Thesis Yair Zick. (2014). Arbitration, fairness and stability. Doctoral thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/60824 10.32657/10356/60824 en 184 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Science::Mathematics::Discrete mathematics::Algorithms
spellingShingle DRNTU::Science::Mathematics::Discrete mathematics::Algorithms
Yair Zick
Arbitration, fairness and stability
description We study the problem of dividing revenue among several collaborative entities. In our setting, each player possesses a nite amount of some divisible resource, and may allocate parts of his resource in order to work on various projects. Having completed tasks and generated pro ts, players must agree on some way of dividing pro ts among them. Using the overlapping coalition formation (OCF) model proposed by Chalkiadakis et al. [2010] as the basis of our work, we develop a model for handling deviation in OCF games. Using our framework, which we term arbitration functions, we propose several new solution concepts for OCF games. In the rst part of this thesis, we analyze the arbitrated core of an OCF game; we show some necessary and su cient conditions for the non-emptiness of some arbitrated cores, and explore methods for computing outcomes in the core of an OCF game. Next, we describe and analyze the arbitrated nucleolus, bargaining set and two notions of a value for OCF games. All of the solution concepts we propose draw strong similarities to their non-OCF counterparts, and in fact contain the classic cooperative solution concepts as a special case. We conclude this thesis by proposing a solution concept for OCF (and non-OCF) cooperative settings that is based on a natural revenue allocation dynamic. In our setting, player revenue in time t acts as his available resources at time t + 1. Assuming that players are not myopic and care about their long-term rewards, we show that under certain conditions, players' incentives become aligned with what is socially optimal. In other words, choosing a payo division that maximizes long-term social welfare will be agreeable for all players.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Yair Zick
format Theses and Dissertations
author Yair Zick
author_sort Yair Zick
title Arbitration, fairness and stability
title_short Arbitration, fairness and stability
title_full Arbitration, fairness and stability
title_fullStr Arbitration, fairness and stability
title_full_unstemmed Arbitration, fairness and stability
title_sort arbitration, fairness and stability
publishDate 2014
url https://hdl.handle.net/10356/60824
_version_ 1759858216227831808