Fairness and Feedback in Learning and Games / Shahin Jabbari.

Format:

Book

Thesis/Dissertation

Author/Creator:

Jabbari, Shahin, author.

Contributor:

Kearns, Michael, degree supervisor.

University of Pennsylvania. Department of Computer and Information Science, degree granting institution.

Language:

English

Subjects (All):

Computer science.

Computer and Information Science--Penn dissertations.

Penn dissertations--Computer and Information Science.

Local Subjects:

Computer science.

Computer and Information Science--Penn dissertations.

Penn dissertations--Computer and Information Science.

Genre:

Academic theses.

Physical Description:

1 online resource (117 pages)

Contained In:

Dissertations Abstracts International 81-05B.

Place of Publication:

[Philadelphia, Pennsylvania] : University of Pennsylvania ; Ann Arbor : ProQuest Dissertations & Theses, 2019.

Language Note:

English

System Details:

Mode of access: World Wide Web.

text file

Summary:

In this thesis, we study fairness and feedback effects in game theory and machine learning. In game theory and economics, financial or technological networks are analyzed for feedback effects. These studies analyze how the connectivity benefits or risk of contagious shocks affect the individual agents or the structure of the network formed by these rational agents. Towards this direction, in the first part of this thesis, we study a series of novel network formation games and analyze the structural properties of the equilibrium networks.Feedback effects can also occur in machine learning problems such as reinforcement learning or sequential allocation problems where the decisions of an algorithm over time can change the resources or actions available to the algorithm in the future as well as the environment in which the algorithm is operating. In the second part of this thesis, we study the effect of these feedback loops and ways to prevent them while also ensuring that the algorithm's actions and allocations satisfy natural notions of fairness. In particular we are interested in quantifying the cost of imposing fairness on learning algorithms.

Notes:

Source: Dissertations Abstracts International, Volume: 81-05, Section: B.

Advisors: Kearns, Michael; Committee members: Sampath Kannan; Sanjeev Khanna; Jamie Morgenstern; Aaron Roth.

Department: Computer and Information Science.

Ph.D. University of Pennsylvania 2019.

Local Notes:

School code: 0175

ISBN:

9781088355619

Access Restriction:

Restricted for use by site license.

This item must not be sold to any third party vendors.