Large economies and two-player games

We characterize the core and the competitive allocations of a continuum economy as strong Nash equilibria of an associated game with only two players.     

Trade through endogenous intermediaries

We propose an intermediation core for an economy that explicitly specifies how traders organize themselves into trade cooperatives (intermediaries) and how trade between them gets carried out. The intermediation core allocations are closely related to the equilibrium allocations of a non-cooperative intermediation game in Townsend (1983). We show that the intermediation core contains all subgame perfect equilibrium allocations of the intermediation game, similar to the inclusion of competitive equilibrium allocations in the core usually studied. We identify intermediation core allocations that are also subgame perfect equilibrium allocations of the intermediation game in terms of the supporting intermediary structures. These results help to characterize subgame perfect equilibrium allocations of the intermediation game and to analyze their welfare and stability properties.     

Every member of the core is as respectful as any other

We strategically separate different core outcomes. The natural counterparts of a core allocation in a strategic environment are the α-core, the β-core and the strong equilibrium, modified by assuming that utility is transferable in a strategic context as well. Given a core allocation ω of a convex transferable utility (TU) game \(v\), we associate a strategic coalition formation game with \( \left( {v, \omega } \right) \) in which ω survives, while most other core allocations are eliminated. If the TU game is strictly convex, the core allocations respected by the TU-α-core, the TU-β-core and the TU-strong equilibrium shrink to ω only in the canonical family of coalition formation games associated with \( \left( {v, \omega } \right) \). A mechanism, which strategically separates core outcomes from noncore outcomes for each convex TU game according to the TU-strong equilibrium notion is reported.     

Bounds for best response functions in binary games

This paper studies the identification of best response functions in binary games without making strong parametric assumptions about the payoffs. The best response function gives the utility maximizing response to a decision of the other players. This is analogous to the response function in the treatment-response literature, taking the decision of the other players as the treatment, except that the best response function has additional structure implied by the associated utility maximization problem. Further, the relationship between the data and the best response function is not the same as the relationship between the data and the response function in the treatment-response literature. We focus especially on the case of a complete information entry game with two firms. We also discuss the case of an entry game with many firms, non-entry games, and incomplete information. Our analysis of the entry game is based on the observation of realized entry decisions, which we then link to the best response functions under various assumptions including those concerning the level of rationality of the firms, including the assumption of Nash equilibrium play, the symmetry of the payoffs between firms, and whether mixed strategies are admitted.     

Equilibria in a class of aggregative location games

Consider a multimarket oligopoly, where firms have a single license that allows them to supply exactly one market out of a given set of markets. How does the restriction to supply only one market influence the existence of equilibria in the game? To answer this question, we study a general class of aggregative location games where a strategy of a player is to choose simultaneously both a location out of a finite set and a non-negative quantity out of a compact interval. The utility of each player is assumed to depend solely on the chosen location, the chosen quantity, and the aggregated quantity of all other players on the chosen location. We show that each game in this class possesses a pure Nash equilibrium whenever the players’ utility functions satisfy the assumptions negative externality, decreasing marginal utility, continuity, and Location–Symmetry. We also provide examples exhibiting that, if one of the assumptions is violated, a pure Nash equilibrium may fail to exist.     

Efficiency of temporary equilibria

A temporary equilibrium model of a production economy with various capital markets in which producers maximize the expected utility of cash flows in various periods is considered. Without restricting the price expectation of producers, it is shown that, if contracts to buy or sell goods at future periods can be trated in a market and if the producer's utility functions are increasing in the cash flow of the first period, then the temporary equilibrium allocations are technically efficient. Also, production is technically efficient even in the presence of some quantity constraints on sales of futures contracts which are sufficient for existence of an equilibrium.     

Set-valued solution concepts using interval-type payoffs for interval games

Uncertainty is a daily presence in the real world. It affects our decision making and may have influence on cooperation. Often uncertainty is so severe that we can only predict some upper and lower bounds for the outcome of our actions, i.e., payoffs lie in some intervals. A suitable game theoretic model to support decision making in collaborative situations with interval data is that of cooperative interval games. Solution concepts that associate with each cooperative interval game sets of interval allocations with appealing properties provide a natural way to capture the uncertainty of coalition values into the players’ payoffs. In this paper, some set-valued solution concepts using interval payoffs, namely the interval core, the interval dominance core and the interval stable sets for cooperative interval games, are introduced and studied. The main results contained in the paper are a necessary and sufficient condition for the non-emptiness of the interval core of a cooperative interval game and the relations between the interval core, the interval dominance core and the interval stable sets of such a game.     

Coalition formation in general NTU games

A general nontransferable utility (NTU) game is interpreted as a collection of pure bargaining games that can be played by individual coalitions. The threatpoints or claims points respectively, in these pure bargaining games reflect the players' opportunities outside a given coalition. We develop a solution concept for general NTU games that is consistent in the sense that the players' outside opportunities are determined by the solution to a suitably defined reduced game. For any general NTU game the solution predicts which coalitions are formed and how the payoffs are distributed among the players.     

Determinacy of equilibrium in outcome game forms

We show the generic finiteness of the number of probability distributions on outcomes induced by Nash equilibria for two-person game forms such that either (i) one of the players has no more than two strategies or (ii) both of the players have three strategies, and (iii) for outcome game forms with three players, each with at most two strategies. Finally, we exhibit an example of a game form with three outcomes and three players for which the Nash equilibria of the associated game induce a continuum of payoffs for an open non-empty set of utility profiles.     

Optimal risk taking in an uneven tournament game with risk averse players

We analyze the optimal choice of risk in a two-stage tournament game between two players that have different concave utility functions. At the first stage, both players simultaneously choose risk. At the second stage, both observe overall risk and simultaneously decide on effort or investment. The results show that those two effects which mainly determine risk taking – an effort effect and a likelihood effect – are strictly interrelated. This finding sharply contrasts with existing results on risk taking in tournament games with symmetric equilibrium efforts where such linkage can never arise. Conditions are derived under which this linkage leads to a reversed likelihood effect so that the favorite (underdog) can increase his winning probability by increasing (decreasing) risk which is impossible in a completely symmetric setting.     

Inefficiency and complementarity in sharing games

A sharing game is a very simple device for partially reconciling an organization’s goal with the interests of its members. Each member chooses an action, bears its cost, and receives a share of the revenue which the members’ actions generate. A (pure-strategy) equilibrium of the game may be inefficient: surplus (revenue minus the sum of costs) may be less than maximal. In a previous paper, we found that for a wide class of reward functions, no one squanders at an inefficient equilibrium (spends more than at an efficient profile) if the revenue function has a complementarity property. In the present paper, we examine the “opposite” of the complementarity property (Substitutes) and we study a class of finite games where squandering equilibria indeed occur if Substitutes holds strongly enough. Squandering equilibria play a key role when one traces the effect of technological improvement on a sharing game’s surplus shortfall. We then turn to the question of choice among reward functions in a principal/agents setting. We find that if we again assume complementarity then strong conclusions can be reached about the reward functions preferred by “society”, by the players (agents), and by the principal.     

Strong Nash equilibrium in games with common and complementary local utilities

A rather general class of strategic games is described where the coalitional improvements are acyclic and hence strong Nash equilibria exist: The players derive their utilities from the use of certain facilities; all players using a facility extract the same amount of local utility therefrom, which amount depends both on the set of users and on their actions, and is decreasing in the set of users; the ultimate utility of each player is the minimum of the local utilities at all relevant facilities. Two important subclasses are “games with structured utilities,” basic properties of which were discovered in 1970s and 1980s, and “bottleneck congestion games,” which attracted researchers’ attention quite recently. The former games are representative in the sense that every game from the whole class is isomorphic to one of them. The necessity of the minimum aggregation for the existence of strong Nash equilibria, actually, just Pareto optimal Nash equilibria, in all games of this type is established.     

Convergence to competitive equilibria and elimination of no-trade (in a strategic market game with limit prices)

The strategic market games literature contains many results that predict Walrasian equilibria in the competitive limit. However, they usually come at the expense of ad hoc assumptions that rule out “pathological” no trade equilibria. This paper studies a strategic market game with limit prices. The set of Nash equilibrium allocations of this game converges to the set containing all competitive equilibria and no-trade, when players are replicated. Moreover, two rounds of iterated deletion of weakly dominated strategies eliminate the no-trade equilibria. Hence, replication paired with two rounds of iterated dominance gives a clean prediction of competitive equilibrium.     

Stackelberg problems with followers in the grand coalition of a Tu-game

In this article, a case of partial cooperation in a game theory framework is studied. The interest is on a bi-level Stackelberg problem where one of the players is the leader and the rest are the followers, involved in a TU-game. The continuity, with respect to the leader’s choice, of the Shapley value function and the core correspondence of the TU-game is investigated.     

Double implementation of the ratio correspondence by a market mechanism

To overcome deficits of the Lindahl solution concept when the economy does not exhibit constant returns to scale, Kaneko (1977a) introduced the concept of aratio equilibrium. Theratio correspondence selects for each economy its set of ratio equilibrium allocations. In this paper we provide a simple market game thatdouble implements the ratio correspondence in Nash and strong equilibria.     

Capabilities and utilities

This paper deals with the problem of looking for resource allocation mechanisms which would be accepted as just in Sen's capabilities framework. We start by suggesting a way of simplifying Sen's idea of capability by using acapability index which measures the ability of a person to function. Then we look for mechanisms providing allocations which could be deemedjust, in pure distribution problems. An allocation will be called just when its corresponding capabilities are leximin suprema. We provide a characterization result of this mechanism in a framework which mimics Roemer's bargaining in economic environments, in which the role of utility functions is now played by capability indices. When a positive relationship between capability indices and utilities exist, just allocations are optimal in utility terms.     

Bargaining through Approval

The paper considers two-person bargaining under Approval Voting. It first proves the existence of pure strategy equilibria. Then it shows that this bargaining method ensures that both players obtain at least their mean utility level in equilibrium. Finally it proves that, provided that the players are partially honest, the mechanism triggers sincerity and ensures that no alternative Pareto dominates the outcome of the game.     

The core can be accessed with a bounded number of blocks

We show the existence of an upper bound for the number of blocks required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the TU game considered. For the class of games with non-empty cores this means that the core can be reached via a bounded sequence of blocks.     

The core can be accessed with a bounded number of blocks

We show the existence of an upper bound for the number of blocks required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the TU game considered. For the class of games with non-empty cores this means that the core can be reached via a bounded sequence of blocks.     

Power and efficiency in production pillage games

A pillage game is a formal model of Hobbesian anarchy as a coalitional game. The technology of pillage is specified by a power function that determines the power of each coalition as a function of its members and their wealth. A coalition can despoil any other coalition less powerful than itself. The present paper studies the problem of achieving an efficient allocation of resources when the required reallocation changes the distribution of power. For example, land redistribution may increase total production, but may also deprive the original owners of the power they need to compel compensation. In this case the original owners would block the redistribution. Previous work on pillage games has focused on the stable set (von Neumann–Morgenstern solution) as a representation of a stable balance of power. However, the balance of power is typically too delicate to support all efficient allocations. The present paper shows that for a large class of power functions, a recently developed extension of the stable set, called the legitimate set, can be rich enough to support all efficient allocations.