Robust equilibria in location games

In the framework of spatial competition, two or more players strategically choose a location in order to attract consumers. It is assumed standardly that consumers with the same favorite location fully agree on the ranking of all possible locations. To investigate the necessity of this questionable and restrictive assumption, we model heterogeneity in consumers’ distance perceptions by individual edge lengths of a given graph. A profile of location choices is called a “robust equilibrium” if it is a Nash equilibrium in several games which differ only by the consumers’ perceptions of distances. For a finite number of players and any distribution of consumers, we provide a complete characterization of robust equilibria and derive structural conditions for their existence. Furthermore, we discuss whether the classical observations of minimal differentiation and inefficiency are robust phenomena. Thereby, we find strong support for an old conjecture that in equilibrium firms form local clusters

Bounding the Inefficiency of Altruism Through Social Contribution Games

We introduce a new class of games, called social contribution games (SCGs), where each player's individual cost is equal to the cost he induces on society because of his presence. Our results reveal that SCGs constitute useful abstractions of altruistic games when it comes to the analysis of the robust price of anarchy. We first show that SCGs are altruism-independently smooth, i.e., the robust price of anarchy of these games remains the same under arbitrary altruistic extensions. We then devise a general reduction technique that enables us to reduce the problem of establishing smoothness for an altruistic extension of a base game to a corresponding SCG. Our reduction applies whenever the base game relates to a canonical SCG by satisfying a simple social contribution boundedness property. As it turns out, several well-known games satisfy this property and are thus amenable to our reduction technique. Examples include min-sum scheduling games, congestion games, second price auctions and valid utility games. Using our technique, we derive mostly tight bounds on the robust price of anarchy of their altruistic extensions. For the majority of the mentioned game classes, the results extend to the more differentiated friendship setting. As we show, our reduction technique covers this model if the base game satisfies three additional natural properties

Dynamic Coordination via Organizational Routines

We investigate dynamic coordination among members of a problem solving team who receive private signals about which of their actions are required for a (static) coordinated solution and who have repeated opportunities to explore different action combinations. In this environment ordinal equilibria, in which agents condition only on how their signals rank their actions and not on signal strength, lead to simple patterns of behavior that have a natural interpretation as routines. These routine spartially solve the team’s coordination problem by synchronizing the team’s search efforts and prove to be resilient to changes in the environment by being expost equilibria, to agents having only a coarse understanding of other agents’ strategies by being fully cursed, and to natural forms of agents’ overcon?dence. The price of this resilience is that optimal routines are frequently not optimal equilibria

Computer Science and Game Theory: A Brief Survey

There has been a remarkable increase in work at the interface of computer science and game theory in the past decade. In this article I survey some of the main themes of work in the area, with a focus on the work in computer science. Given the length constraints, I make no attempt at being comprehensive, especially since other surveys are also available, and a comprehensive survey book will appear shortly.Comment: To appear; Palgrave Dictionary of Economic

Ten possible experiments on communication and deception

I describe ten situations in which experimental data may provide useful guidance to the study of cheap-talk games. Journal of Economic Literature Classification Numbers: C92, D8. © 2013 Elsevier B.V

A simplicial algorithm for computing proper Nash equilibria of finite games

Stationary Point;Game Theory;Nash Equilibrium