2020-11-24 16:00:00 2020-11-24 17:00:00 America/New_York Extensions to the game of chicken in the context of public goods Bryan Chong, Ph.D. Candidate https://us04web.zoom.us/j/73506685951?pwd=cUR4L0dmV3NYc2ZodnRWR0FseEFzZz09

November 24, 2020

Extensions to the game of chicken in the context of public goods

Event Date: November 24, 2020
Sponsor: Mario Ventresca
Sponsor URL: https://engineering.purdue.edu/IE/people/ptProfile?resource_id=97417
Time: 4:00 pm ET
Location: https://us04web.zoom.us/j/73506685951?pwd=cUR4L0dmV3NYc2ZodnRWR0FseEFzZz09
Contact Name: Anita Park
Contact Email: apark@purdue.edu
Priority: No
School or Program: Industrial Engineering
College Calendar: Show
Bryan Chong, Ph.D. Candidate
Bryan Chong, Ph.D. Candidate
Bryan Chong, Ph.D. Candidate

ABSTRACT

We study the Edge-Building Game (EBG), a parameterized formulation of the game of chicken in the context of a public goods game. In the EBG, each of two players can either commit or abstain to building a shared resource. At least one person must commit in order for the resource to be built, but neither wants to contribute the associated edge cost. They must then trade off the possible benefit of gaining the resource for nothing against the chance that neither get anything at all. Contexts include trade deals between countries and interest signalling in interpersonal relationships. All games are also studied under the lens of mechanism design, where a designer sets up the game in a particular way so as to encourage certain outcomes. 

We first study two extensions to the game: the EBG on a continuous strategy set where players can propose from a continuum of strength (as opposed to just proposing or abstaining), and the EBG with multiple players on the same resource. Even with continuous strategy sets, the EBG is a discontinuous game, and we find discontinuous Nash equilibrium distributions for a few different game scenarios. These discontinuous equilibria take the following general form: Propose with a fixed probability, and with the remaining probability draw from some parameterized probability distribution. 

Finally, we play the game on a graph/network, both in simultaneous- and sequential-play rules. We explore the general intractability of computing Nash and correlated equilibria of the EBG on networks, and including some special cases where socially optimal equilibria can be efficiently found. We then run simulations of the sequential game, where pairs of players on the network take turns playing, and study the effect of convex combinations of utility functions on network measures. We also introduce a novel network measure that we use as one of the utility functions.