Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns

In Boolean games, agents try to reach a goal formulated as a Boolean formula. These games are attractive because of their compact representations. However, few methods are available to compute the solutions and they are either limited or do not take privacy or communication concerns into account. In this paper we propose the use of an algorithm related to reinforcement learning to address this problem. Our method is decentralized in the sense that agents try to achieve their goals without knowledge of the other agents’ goals. We prove that this is a sound method to compute a Pareto optimal pure Nash equilibrium for an interesting class of Boolean games. Experimental results are used to investigate the performance of the algorithm.

Effect of Selfish Node Behavior on Efficient Topology Design

The problem of topology control is to assign per-node transmission power such that the resulting topology is energy efficient and satisfies certain global properties such as connectivity. The conventional approach to achieve these objectives is based on the fundamental assumption that nodes are socially responsible. We examine the following question: if nodes behave in a selfish manner, how does it impact the overall connectivity and energy consumption in the resulting topologies? We pose the above problem as a noncooperative game and use game-theoretic analysis to address it. We study Nash equilibrium properties of the topology control game and evaluate the efficiency of the induced topology when nodes employ a greedy best response algorithm. We show that even when the nodes have complete information about the network, the steady-state topologies are suboptimal. We propose a modified algorithm based on a better response dynamic and show that this algorithm is guaranteed to converge to energy-efficient and connected topologies. Moreover, the node transmit power levels are more evenly distributed, and the network performance is comparable to that obtained from centralized algorithms.

Partial Cooperative Equilibria: Existence and Characterization

We study the solution concepts of partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria. The partial cooperative Cournot-Nash equilibrium is axiomatically characterized by using notions of rationality, consistency and converse consistency with regard to reduced games. We also establish sufficient conditions for which partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria exist in supermodular games. Finally, we provide an application to strategic network formation where such solution concepts may be useful.

Coordination, Efficiency and Two-Sided Cheap Talk

We consider the Battle of the Sexes game with incomplete information and allow two-sided cheap talk before the game is played. We characterise the set of fully revealing symmetric cheap talk equilibria. The best fully revealing symmetric cheap talk equilibrium, when exists, has a desirable characteristic. When the players' types are different, it fully coordinates on the ex-post efficient pure Nash equilibrium. We also analyse the mediated communication equilibria of the game. We find the range of the prior for which this desirable equilibrium exists under unmediated and mediated communication processes.

Ambiguity, social opinion and the use of common property resources

In this paper we argue that ambiguity, combined with social opinion formation, can be used as the foundation of a game-theoretic equilibrium concept that transcends the standard Nash equilibrium concept, applied to a model of the tragedy of the commons. Our approach sheds light on the international environmental crisis and the relevant ongoing international negotiations. We conclude that social opinion formation in most cases has a significant impact on equilibrium common property resource usage.

Strategic behavior under partial cooperation

We investigate how a group of players might cooperate with each other within the setting of a non-cooperative game. We pursue two notions of partial cooperative equilibria that follow a modification of Nash's best response rationality rather than a core-like approach. Partial cooperative Nash equilibrium treats non-cooperative players and the coalition of cooperators symmetrically, while the notion of partial cooperative leadership equilibrium assumes that the group of cooperators has a first-mover advantage. We prove existence theorems for both types of equilibria. We look at three well-known applications under partial cooperation. In a game of voluntary provision of a public good we show that our two new equilibrium notions of partial cooperation coincide. In a modified Cournot oligopoly, we identify multiple equilibria of each type and show that a non-cooperator may have a higher payoff than a cooperator. In contrast, under partial cooperation in a symmetric Salop City game, a cooperator enjoys a higher return.

Stressed Web Environments as Strategic Games: Risk Profiles and Weltanschauung

We consider the behaviour of a set of services in a stressed web environment where performance patterns may be difficult to predict. In stressed environments the performances of some providers may degrade while the performances of others, with elastic resources, may improve. The allocation of web-based providers to users (brokering) is modelled by a strategic non-cooperative angel-daemon game with risk profiles. A risk profile specifies a bound on the number of unreliable service providers within an environment without identifying the names of these providers. Risk profiles offer a means of analysing the behaviour of broker agents which allocate service providers to users. A Nash equilibrium is a fixed point of such a game in which no user can locally improve their choice of provider – thus, a Nash equilibrium is a viable solution to the provider/user allocation problem. Angel daemon games provide a means of reasoning about stressed environments and offer the possibility of designing brokers using risk profiles and Nash equilibria.

Implementing efficient graphs in connection networks

We consider the problem of sharing the cost of a network that meets the connection demands of a set of agents. The agents simultaneously choose paths in the network connecting their demand nodes. A mechanism splits the total cost of the network formed among the participants. We introduce two new properties of implementation. The first property, Pareto Nash implementation (PNI), requires that the efficient outcome always be implemented in a Nash equilibrium and that the efficient outcome Pareto dominates any other Nash equilibrium. The average cost mechanism and other asymmetric variations are the only mechanisms that meet PNI. These mechanisms are also characterized under strong Nash implementation. The second property, weakly Pareto Nash implementation (WPNI), requires that the least inefficient equilibrium Pareto dominates any other equilibrium. The egalitarian mechanism (EG) and other asymmetric variations are the only mechanisms that meet WPNI and individual
rationality. EG minimizes the price of stability across all individually rational mechanisms. © Springer-Verlag Berlin Heidelberg 2012

Key Players and Key Groups in Teams

This paper contributes to the literature on centrality measures in economics by defining a team game and identifying the key players and key groups
in the game. We extend the work of Ballester et al. (Econometrica, 2006) by incorporating a network outcome component in the players' payoff functions and prove that there is a unique interior Nash Equilibrium in pure strategies. We develop a team intercentrality measure based on alternative scenarios that capture the externality created by teammates on each player.

Partial Cooperation in Strategic Decision Situations

We consider a normal form game in which there is a single exogenously given coalition of cooperating players that can write a binding agreement on pre-selected actions. These collective actions typically represent a certain number of dimensions in the players’ strategy space. The actions represented by the other dimensions of the strategy space remain under the complete, individual control of the players.
We consider a standard extension of the Nash equilibrium concept denoted as a partial cooperative equilibrium as well as an equilibrium concept in which the coalition of cooperators has a leadership position. Existence results are developed for these new equilibrium concepts. We identify conditions on these partial cooperative games under which the various equilibrium concepts are equivalent.
We apply this game theoretic framework to existing models of multi-market oligopolies and international pollution abatement. In a multi-market oligopoly typically a merger paradox emerges in the partial cooperative equilibrium, which vanishes if the cartel of collaborators exploits its leadership position. Our application to international pollution abatement treaties shows that cooperation by a sufficiently large group of countries results in a Pareto improvement over the standard tragedy of the commons outcome described by the Nash equilibrium.

Nash equilibria of network formation games under consent

We investigate the Nash equilibria of game theoretic models of network formation based on explicit consent in link formation. These so-called “consent models” explicitly take account of link formation costs. We provide characterizations of Nash equilibria of such consent models under both one-sided and two-sided costs of link formation. We relate these equilibrium concepts to link-based stability concepts, in particular strong link deletion proofness.

Density functional and Monte Carlo studies of sulfur. II. Equilibrium polymerization of the liquid phase

The equilibrium polymerization of sulfur is investigated by Monte Carlo simulations. The potential energy model is based on density functional results for the cohesive energy, structural, and vibrational properties as well as reactivity of sulfur rings and chains [Part I, J. Chem. Phys. 118, 9257 (2003)]. Liquid samples of 2048 atoms are simulated at temperatures 450less than or equal toTless than or equal to850 K and P=0 starting from monodisperse S-8 molecular compositions. Thermally activated bond breaking processes lead to an equilibrium population of unsaturated atoms that can change the local pattern of covalent bonds and allow the system to approach equilibrium. The concentration of unsaturated atoms and the kinetics of bond interchanges is determined by the energy DeltaE(b) required to break a covalent bond. Equilibrium with respect to the bond distribution is achieved for 15less than or equal toDeltaE(b)less than or equal to21 kcal/mol over a wide temperature range (Tgreater than or equal to450 K), within which polymerization occurs readily, with entropy from the bond distribution overcompensating the increase in enthalpy. There is a maximum in the polymerized fraction at temperature T-max that depends on DeltaE(b). This fraction decreases at higher temperature because broken bonds and short chains proliferate and, for Tless than or equal toT(max), because entropy is less important than enthalpy. The molecular size distribution is described well by a Zimm-Schulz function, plus an isolated peak for S-8. Large molecules are almost exclusively open chains. Rings tend to have fewer than 24 atoms, and only S-8 is present in significant concentrations at all T. The T dependence of the density and the dependence of polymerization fraction and degree on DeltaE(b) give estimates of the polymerization temperature T-f=450+/-20 K. (C) 2003 American Institute of Physics.