Author ORCID Identifier

https://orcid.org/0000-0002-8365-4186

Date Available

5-7-2021

Year of Publication

2021

Degree Name

Doctor of Philosophy (PhD)

Document Type

Doctoral Dissertation

College

Engineering

Department/School/Program

Computer Science

First Advisor

Dr. Judy Goldsmith

Abstract

We present here work on matching problems, namely hedonic games, also known as coalition formation games. We introduce two classes of hedonic games, Super Altruistic Hedonic Games (SAHGs) and Anchored Team Formation Games (ATFGs), and investigate the computational complexity of finding optimal partitions of agents into coalitions, or finding - or determining the existence of - stable coalition structures. We introduce a new stability notion for hedonic games and examine its relation to core and Nash stability for several classes of hedonic games.

Digital Object Identifier (DOI)

https://doi.org/10.13023/etd.2021.116

Funding Information

This study was supported by the Lexmark Fellowship from the University of Kentucky in 2018-2019.

This study was supported by the Graduate Fellowship from the University of Kentucky in 2016-2017.

Share

COinS