Pay or Play

We introduce the class of pay or play games, which captures scenarios in which each decision maker is faced with a choice between two actions: one with a fixed payoff and another with a payoff dependent on others' selected actions. This is, arguably, the simplest setting that models selection among certain and uncertain outcomes in a multi-agent system. We study the properties of equilibria in such games from both a game-theoretic perspective and a computational perspective. Our main positive result establishes the existence of a semi-strong equilibrium in every such game. We show that although simple, pay or play games contain well-studied environments, e.g., vaccination games. We discuss the interesting implications of our results for these environments.

[1]  Eric Horvitz,et al.  An approximate nonmyopic computation for value of information , 1994, UAI 1994.

[2]  Yishay Mansour,et al.  The communication complexity of uncoupled nash equilibrium procedures , 2007, STOC '07.

[3]  A. Razborov Communication Complexity , 2011 .

[4]  H. Kunreuther,et al.  Interdependent Security , 2003 .

[5]  Ronald A. Howard,et al.  Information Value Theory , 1966, IEEE Trans. Syst. Sci. Cybern..

[6]  M. Armstrong,et al.  Price Discrimination ∗ , 1999 .

[7]  Po-An Chen,et al.  Better vaccination strategies for better people , 2010, EC '10.

[8]  H. Varian Price Discrimination and Social Welfare , 1985 .

[9]  Luis E. Ortiz,et al.  Algorithms for Interdependent Security Games , 2003, NIPS.

[10]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[11]  Christos H. Papadimitriou,et al.  The complexity of pure Nash equilibria , 2004, STOC '04.

[12]  L. Shapley,et al.  Potential Games , 1994 .

[13]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[14]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[15]  R. Rosenthal A class of games possessing pure-strategy Nash equilibria , 1973 .

[16]  James Aspnes,et al.  Inoculation strategies for victims of viruses and the sum-of-squares partition problem , 2005, SODA '05.

[17]  Eric Horvitz,et al.  A Graph-Theoretic Analysis of Information Value , 1996, UAI.

[18]  I. Milchtaich,et al.  Congestion Games with Player-Specific Payoff Functions , 1996 .