Bad equilibria (and what to do about them)

I begin by arguing that the notion of economic equilibrium is an important analytical tool with which to understand the behaviour of today's networked computer systems. This is because the behaviours that such systems exhibit are in part a function of the preferences and desires of system participants; this gives such systems the flavour of an economic system. In economics, an equilibrium is a steady-state situation, which obtains because no participant has any rational incentive to deviate from it. Equilibrium concepts are arguably the most important and widely used analytical weapons in the game theory arsenal. The concept of Nash equilibrium in particular has found a huge range of applications, in areas as diverse and seemingly unrelated as evolutionary biology and moral philosophy. However, there remain fundamental problems associated with Nash equilibria and their application, which must be considered if we want to apply them to the analysis of computer systems. First, there may be multiple Nash equilibria, in which case, how should we choose between them? Second, some equilibria may be undesirable, in which case, how can we avoid them? In this essay, I will introduce work that we have done addressing these problems from a computational/AI perspective. Assuming no prior knowledge of game theory or economic solution concepts, I will discuss various ways in which we can try to engineer a scenario so that desirable equilibria result, or else engineer out undesirable equilibria.

[1]  Moshe Tennenholtz,et al.  On the Synthesis of Useful Social Laws for Artificial Agent Societies (Preliminary Report) , 1992, AAAI.

[2]  Michael Wooldridge,et al.  An Introduction to MultiAgent Systems, Second Edition , 2009 .

[3]  ROBIN MILNER,et al.  Edinburgh Research Explorer A Calculus of Mobile Processes, I , 2003 .

[4]  A. Roth,et al.  Last-Minute Bidding and the Rules for Ending Second-Price Auctions: Evidence from eBay and Amazon Auctions on the Internet , 2002 .

[5]  Sarit Kraus,et al.  Cooperative Boolean games , 2008, AAMAS.

[6]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[7]  Michael Wooldridge,et al.  Normative system games , 2007, AAMAS '07.

[8]  Michael Wooldridge,et al.  On the logic of cooperation and propositional control , 2005, Artif. Intell..

[9]  Sarit Kraus,et al.  Designing incentives for Boolean games , 2011, AAMAS.

[10]  Michael Wooldridge,et al.  Introduction to multiagent systems , 2001 .

[11]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[12]  Sarit Kraus,et al.  Manipulating Boolean Games through Communication , 2011, IJCAI.

[13]  Stephan Merz,et al.  Model Checking , 2000 .

[14]  James A. Hendler,et al.  The Semantic Web" in Scientific American , 2001 .

[15]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[16]  Cees Witteveen,et al.  Boolean games , 2001 .

[17]  Michael Wooldridge,et al.  An Introduction to MultiAgent Systems John Wiley & Sons , 2002 .

[18]  Zohar Manna,et al.  Temporal verification of reactive systems - safety , 1995 .

[19]  Huajun Chen,et al.  The Semantic Web , 2011, Lecture Notes in Computer Science.

[20]  W. Hamilton,et al.  The evolution of cooperation. , 1984, Science.

[21]  Robin Milner,et al.  Ubiquitous Computing: Shall we Understand It? , 2006, Comput. J..

[22]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[23]  David L. Cohn,et al.  Autonomic Computing , 2003, ISADS.