Farsightedly stable networks

A set of networks G is pairwise farsightedly stable (i) if all possible farsighted pairwise deviations from any network g∈ G to a network outside G are deterred by the threat of ending worse off or equally well off, (ii) if there exists a farsighted improving path from any network outside the set leading to some network in the set, and (iii) if there is no proper subset of G satisfying conditions (i) and (ii). A non-empty pairwise farsightedly stable set always exists. We provide a full characterization of unique pairwise farsightedly stable sets of networks. Contrary to other pairwise concepts, pairwise farsighted stability yields a Pareto dominant network, if it exists, as the unique outcome. Finally, we study the relationship between pairwise farsighted stability and other concepts such as the largest pairwise consistent set and the von Neumann–Morgenstern pairwise farsightedly stable set.     

FARSIGHTED COALITIONAL STABILITY OF A PRICE LEADERSHIP CARTEL

This paper analyzes the farsighted behaviour of firms that form a dominant price leadership cartel. We consider stability concepts such as the farsighted core, the farsighted stable sets, and the largest consistent set. We show that: (i) the farsighted core is either an empty set or a singleton set of the grand cartel; (ii) any Pareto efficient cartel is itself a farsighted stable set; and (iii) the set of cartels in which fringe firms enjoy higher profits than the firms in the minimal Pareto efficient cartel is the largest consistent set.     

Networks and farsighted stability

We provide a new framework for the analysis of network formation and demonstrate the existence of farsightedly consistent directed networks. Our framework extends the standard notion of a network and also introduces the notion of a supernetwork. A supernetwork is made up of a collection of directed networks (the nodes) and represents (via the arcs connecting the nodes) preferences and rules governing network formation. By extending Chwe's 1994 result on the nonemptiness of farsightedly consistent sets, we show that for any supernetwork there exists a nonempty subset of farsightedly consistent directed networks.     

Networks of Free Trade Agreements among Heterogeneous Countries

The paper examines the formation of free trade agreements as a network formation game. We consider an n‐country model in which international trade occurs between economies with imperfectly competitive product markets. In each country, the labor market is either unionized or non‐unionized. We show that, if all countries are non‐unionized, the global free trade network is both the unique pairwise stable network and the unique efficient network. If all countries are unionized, the global free trade network is pairwise stable and the unique efficient network among the class of symmetric networks. If some countries are unionized while others are non‐unionized, other networks apart from the global free trade network may be pairwise stable. However, the efficient network is still the global free trade network. Thus, a conflict between stability and efficiency may occur. Moreover, starting from the network in which no country has signed a free trade agreement, all sequences of networks due to continuously profitable deviations do not lead (in most cases) to the global free trade network, even when global free trade is stable.     

Market structure and matching with contracts

Ostrovsky (2008) [9] develops a theory of stability for a model of matching in exogenously given networks. For this model a generalization of pairwise stability, chain stability, can always be satisfied as long as agents' preferences satisfy same side substitutability and cross side complementarity. Given this preference domain I analyze the interplay between properties of the network structure and (cooperative) solution concepts. The main structural condition is an acyclicity notion that rules out the implementation of trading cycles. It is shown that this condition and the restriction that no pair of agents can sign more than one contract with each other are jointly necessary and sufficient for (i) the equivalence of group and chain stability, (ii) the core stability of chain stable networks, (iii) the efficiency of chain stable networks, (iv) the existence of a group stable network, and (v) the existence of an efficient and individually stable network. These equivalences also provide a rationale for chain stability in the unrestricted model. The (more restrictive) conditions under which chain stability coincides with the core are also characterized.     

Stable cartels revisited

Summary. This paper analyzes cartel stability when firms are farsighted. It studies a price leadership model á la D Aspremont et al. (1983), where the dominant cartel acts as a leader by determining the market price, while the fringe behaves competitively. According to D Aspremont et al. s (1983) approach a cartel is stable if no firm has an incentive to either enter or exit the cartel. In deciding whether to deviate or not, a firm compares its status quo with the outcome its unilateral deviation induces. However, the firm fails to examine whether the induced outcome will indeed become the new status quo that will determine its profits. Although the firm anticipates the price adjustment following its deviation, it ignores the possibility that more firms may exit (or enter) the cartel. In other words, the firm does not consider the fact that the outcome immediately induced by its deviation may not be stable itself. We propose a notion of cartel stability that allows firms to fully foresee the result of their deviation. Our solution concept is built in the spirit of von Neumann and Morgensterns (1944) stable set, while it modifies the dominance relation following Harsanyis (1974) criticism. We show that there always exists a unique, non-empty set of stable cartels.Received: 20 August 2002, Revised: 11 August 2004, JEL Classification Numbers: C79, D43, D49, L13.On page 921, the final paragraph as well as the two references by Rothschild were inserted.This revised version was pulished in February 2005.I would like to thank Joseph Greenberg, Licun Xue, Daniel Arce M. and Curtis Eberwein for their helpful suggestions on an earlier draft. I am indebted to an anonymous referee for his very constructive comments.     

p-Best response set and the robustness of equilibria to incomplete information

In this paper, we use p-best response sets—a set-valued extension of p-dominance—in order to provide a new sufficient condition for the robustness of equilibria to incomplete information: if there exists a set S which is a p-best response set with , and there exists a unique correlated equilibrium μ^* whose support is in S then μ^* is a robust Nash equilibrium.     

Farsighted strategies in the formation of a communication network

I examine the formation of a specific communication network, a variant of the two-way flow model, in which agents have farsighted strategies. I show that the likelihood to form efficient networks tends to zero for sufficiently large network sizes.     

Convergence and approximation results for non-cooperative Bayesian games: Learning theorems

Summary LetT denote a continuous time horizon and {G ^t :tT} be a net (generalized sequence) of Bayesian games. We show that: (i) if {x ^t : tT} is a net of Bayesian Nash Equilibrium (BNE) strategies for G^t we can extract a subsequence which converges to a limit full information BNE strategy for a one shot limit full information Bayesian game, (ii) If {x ^t : tT} is a net of approximate or _t-BNE strategies for the game G^t we can still extract a subsequence which converges to the one shot limit full information equilibrium BNE strategy, (iii) Given a limit full information BNE strategy of a one shot limit full information Bayesian game, we can find a net of _t-BNE strategies {x ^t : tT} in {G ^t :tT} which converges to the limit full information BNE strategy of the one shot game.We wish to thank Larry Blume, Mark Feldman, Jim Jordan, Charlie Kahn, Stefan Krasa, Gregory Michalopoulos, Wayne Shafer, Bart Taub, and Anne Villamil for several useful discussions. The financial support of the University of Illinois at Urbana-Champaign Campus Research Board is gratefully acknowledged.     

Farsighted network formation

This paper studies a model of dynamic network formation when individuals are farsighted: players evaluate the desirability of a “current” move in terms of its consequences on the entire discounted stream of payoffs. We define a concept of equilibrium which takes into account farsighted behavior of agents and allows for limited cooperation amongst agents. We show that an equilibrium process of network formation exists. We also show that there are valuation structures in which no equilibrium strategy profile can sustain efficient networks. We then provide sufficient conditions under which the equilibrium process will yield efficient outcomes.     

On Forward Induction and Evolutionary and Strategic Stability

We analyze which normal form solution concepts capture the notion of forward induction, as defined by E. van Damme (1989, J. Econ. Theory48, 476-496) in the class of generic two player normal form games preceded by an outside option. We find that none of the known strategic stability concepts (including Mertens stable sets and hyperstable sets) capture this form of forward induction. On the other hand, we show that the evolutionary concept of EES set (J. Swinkels, 1992, J. Econ. Theory57, 306-332) is always consistent with forward induction. Journal of Economic Literature Classification Number: C72.     

When sunspots don't matter

Summary We show that a finite, competitive economy isimmune to sunspots if (i) preferences are strictly convex, (ii) the set of feasible allocations is convex, and (iii) the contingent-claims market is perfect. The conditions (i)–(ii) cover some, but not all, economies with nonconvex technologies. Based on an indivisible-good example, we show that even economies with strictly convex preferences and full insurance arenot in general immune from sunspots. We also show that (1) the sufficient conditions (i)–(iii) are not necessary for sunspot immunity and (2)ex-ante efficiency is not necessary for immunity from sunspots.This paper is based on an earlier paper, Indivisibilities in Production, and Sunspot Equilibrium, presented at the 1990 S.E.D.C. Meetings, Minneapolis-St. Paul, June 1990. The research support of NSF Grant SES-9012780, the Center for Analytic Economics, and the Thorne Fund is gratefully acknowledged.     

Inequality and network structure

We explore the manner in which the structure of a social network constrains the level of inequality that can be sustained among its members, based on the following considerations: (i) any distribution of value must be stable with respect to coalitional deviations, and (ii) the network structure itself determines the coalitions that may form. We show that if players can jointly deviate only if they form a clique in the network, then the degree of inequality that can be sustained depends on the cardinality of the maximum independent set. For bipartite networks, the size of the maximum independent set fully characterizes the degree of inequality that can be sustained. This result extends partially to general networks and to the case in which a group of players can deviate jointly if they are all sufficiently close to each other in the network.     

Joint production in teams

Consider Holmström's moral hazard in teams problem when there are n agents, each agent i has an a_i-dimensional strategy space and output is m-dimensional. We show that a compensation mechanism that satisfies budget balance, limited liability and implements an efficient allocation generically exists if and only if . Moreover, under a weak additional condition, the equilibrium implemented by this mechanism is unique in the class of pure strategy Coalition-Proof equilibria.     

Designer path independent choice functions

Summary. This paper provides an algorithm for the construction of all PICFs on a finite set of alternatives, V, designed by an a priori given set I of initial choices as well as the determination of whether the initial set I is consistent with path independence. The algorithm is based on a new characterization result for path independent choice functions (PICF) on finite domains and uses that characterization as the basis of the algorithm. The characterization result identifies two properties of a partition of the Boolean algebra as necessary and sufficient for a choice function C to be a PICF: (i): For every subset A of V the set is an interval in the Boolean algebra 2 ^V . (ii): If A/B is an interval in the Boolean algebra such that C(A) = C(B) and if M/N is an upper transpose of A/B then C(M) = C(N). The algorithm proceeds by expanding on the implications of these two properties.Received: 5 November 2003, Revised: 20 July 2004, JEL Classification Numbers: D00, D70.     

Returns from social capital in open source software networks

Open Source Software projects base their operation on a collaborative structure for knowledge exchange in the form of provision or reception of information, expertise and feedback on the creation of source code. Here, we address the direction of these knowledge flows among projects throughout social networks and their impact on project success. We identify the roles of membership or contribution that individuals play within projects. We found that connections through contributors who bring their knowledge to the project, improve project success, and that connection through members, who transfer their knowledge towards other projects, enhance project success. Finally, we found that ties through shared membership and contributions hamper project success. The analysis of knowledge flows and their impact on project success imply a translation of returns from investment in social capital, where investment takes the shape of knowledge flows and the returns mean the projects’ diffusion over the network.

On core stability, vital coalitions, and extendability

If a TU game is extendable, then its core is a stable set. However, there are many TU games with a stable core that are not extendable. A coalition is vital if there exists some core element x such that none of the proper subcoalitions is effective for x. It is exact if it is effective for some core element. If all coalitions that are vital and exact are extendable, then the game has a stable core. It is shown that the contrary is also valid for matching games, for simple flow games, and for minimum coloring games.     

Uniform payoff security and Nash equilibrium in compact games

We introduce a condition, uniform payoff security, for games with compact Hausdorff strategy spaces and payoffs bounded and measurable in players’ strategies. We show that if any such compact game G is uniformly payoff secure, then its mixed extension is payoff secure. We also establish that if a uniformly payoff secure compact game G has a mixed extension with reciprocally upper semicontinuous payoffs, then G has a Nash equilibrium in mixed strategies. We provide several economic examples of compact games satisfying uniform payoff security.     

International Environmental Agreements—The Role of Foresight

The present paper attempts to bridge the gap between the cooperative and the non-cooperative approach employed to examine the size of stable coalitions, formed to address global environmental problems. We do so by endowing countries with foresightedness, that is, by endogenizing the reaction of the coalition’s members to a deviation by one member. We assume that when a country contemplates withdrawing or joining an agreement, it takes into account the reactions of other countries ignited by its own actions. We identify conditions under which there always exists a unique set of farsighted stable IEAs. The new farsighted IEAs can be much larger than those some of the previous models supported but are not always Pareto efficient.     

Resource availability in the social cloud: An economics perspective

Social cloud has emerged as a case of sharing economy, where socially connected agents share their computing resources within the community. This paper considers the social cloud as an endogenous resource-sharing network, where agents are involved in closeness-based conditional resource sharing. This study focuses on (1) the impact of agents' decisions of link addition and deletion on their own local and global resource availability as well as on others' global resource availability (as spillover effects), (2) the role of agents' closeness in determining spillover effects, (3) agents' link addition behavior, and (4) stability and efficiency of the social cloud. The findings include the following: (i) Agents' decision of link addition (deletion) increases (decreases) their local resource availability. However, these observations do not hold in the case of global resource availability. (ii) In a connected network, agents experience either a positive or a negative spillover effect and there is no case with no spillover effects. Agents observe no spillover effects if and only if the network is disconnected with three or more components. Furthermore, an agent experiences negative spillover if there is no change in its closeness. Although an increase in the closeness of agents is necessary to experience positive spillover effects, the condition is not sufficient. (iii) We study the relation between agents' distance from each other, and their local as well as global resource availabilities. We prove that the local resource availability of an agent from another agent increases with decrease in the distance between them and that maximum local resource availability is obtained from the agent with the least closeness. Using these results, we discuss which agent to add a link to, so as to maximize the local resource availability. We discuss why such results are difficult to establish for global resource availability. However, in a two-diameter network, we show that for an agent, link formation always increases the global resource availability. (iv) We also study resource-sharing network formation and its efficiency in a strategic setting. We prove the existence of a pairwise stable network. Furthermore, we provide a set of conditions for a few prominent network structures (star, complete, wheel, and bipartite networks) to be pairwise stable. We show that the “connected in pairs, otherwise disconnected” network is better than a connected network, in terms of social welfare.