An axiomatization of the egalitarian solutions

The egalitarian solutions for general cooperative games which were defined and axiomatized by Kalai and Samet, are compared to the Harsanyi solution. It is shown that axioms used by Hart to characterize the Harsanyi solution can be used to characterize the (symmetric) egalitarian solution. The only changes needed are the omission of the scale covariance axiom and the inclusion, in the domain of the solution, of games which lack a certain smoothness requirement.     

A remark on the Harsanyi-Selten theory of equilibrium selection

We consider a class of 3-person games in normal form with two pure strategies for each player and two strict equilibrium points. To select one of these two strict equilibrium points as the solution, the equilibrium selection theory of Harsanyi and Selten is applied. The games are constructed in such a way that the a priori probabilities reflect somewhat poorly the risk situation of the players. It is argued and illustrated by examples that this might yield unreasonable results. The a priori probabilities would describe the risk situation of the players more completely if their definition were not based on the expectation of correlated decision behavior.     

多重均衡选择中的风险占优与混合策略

均衡选择理论是博弈理论的重要组成部分.风险占优均衡是人们经济决策或行为的一个主要结果.利用混合策略及其性质和“抵制”的概念,“支持”了海萨尼和泽尔腾用公理定义的风险占优概念,且具体给出了识别风险占优均衡的标准和方法,并把它们推广到对称博弈中去.最后对均衡占优的直觉概念和风险占优相冲突的一些博弈进行了类似的讨论.     

Consistency and the graph Banzhaf value for communication graph games

The graph Banzhaf value was introduced and axiomatically characterized by Alonso-Meijide and Fiestras-Janeiro (2006). In this paper we propose the reduced game and consistency of the graph Banzhaf value for communication situations. By establishing the relationship between the Harsanyi dividends of a coalition in a communication situation and the reduced communication situation, we provide a new axiomatization of the graph Banzhaf value by means of the axioms of consistency and standardness.     

Harsanyi power solutions for graph-restricted games

We consider cooperative transferable utility games, or simply TU-games, with limited communication structure in which players can cooperate if and only if they are connected in the communication graph. Solutions for such graph games can be obtained by applying standard solutions to a modified or restricted game that takes account of the cooperation restrictions. We discuss Harsanyi solutions which distribute dividends such that the dividend shares of players in a coalition are based on power measures for nodes in corresponding communication graphs. We provide axiomatic characterizations of the Harsanyi power solutions on the class of cycle-free graph games and on the class of all graph games. Special attention is given to the Harsanyi degree solution which equals the Shapley value on the class of complete graph games and equals the position value on the class of cycle-free graph games. The Myerson value is the Harsanyi power solution that is based on the equal power measure. Finally, various applications are discussed.     

Absorbing set forn-person games

This study tries to modify von Neumann and Morgenstern (vN-M) solution. As with John Harsanyi in 1974, vN-M solution is viewed in a dynamic sense. The final outcome of a game not only depends on the ability of players and standards of behavior of the particular society but also upon which imputation is proposed first. An absorbing property is obtained as a result of modifying the bargaining process of Harsanyi. This modified solution concept maintains the internal stability condition of vN-M solution, and replaces their external stability condition by this absorbing property.

---

Zusammenfassung Diese Arbeit zielt auf eine Modifizierung des Begriffs der von Neumann-Morgenstern (vN-M) Lösung. In Anlehnung an John Harsanyi (1974) werden vN-M-Lösungen dynamisch interpretiert. Das endgültige Ergebnis eines Spiels hängt nicht nur von der Fähigkeit der Spieler und den Verhaltensstandards einer bestimmten Gesellschaft ab, sondern auch davon, welche Imputation zunächst vorgeschlagen wird. Durch eine entsprechende Modifizierung des von Harsanyi vorgeschlagenen Verhandlungsprozesses erhält man eine Absorbtionseigenschaft. Das demgemäß modifizierte Lösungskonzept erhält die interne Stabilitätsbedingung der vN-M-Lösung und ersetzt die externe Stabilitätsbedingung durch die Absorbtionseigenschaft.

     

Equilibrium selection in a bargaining problem with transaction costs

It is the purpose of the paper to analyse a bargeining situation with the help of the equilibrium selection theory of John C. Harsanyi and Reinhard Selten. This theory selects one equilibrium point in every finite non-cooperative game. The bargaining problem is the following one: the two bargainers — player 1 and player 2 — simultaneously and independently propose a payoffx of player 1 in the interval 〈0, 1〉. If agreement is reached player 2's payoffs is 1?x. Otherwise both receive zero. Each playeri has a further alternativeW _i , namely not to bargain at all (i=1, 2). Thereby he avoids transaction costsc andd of bargaining which arise whether an agreement is reached or not. One may think of an illegal deal where bargaining involves a risk of being punished — independently whether the deal is made or not. The model has the form of a (K+1)×(K+1)-bimatrix game. It is assumed that there is an indivisable smallest money unit. The game hasK+1 pure strategy equilibrium points.K of them correspond to an agreement and the last one is the strategy pair where both players refuse to bargain. Each of theK+1 equilibrium points can be the solution of the game. The aim of the Harsanyi-Selten-theory is to select in a unique way one of these equilibrium points by an iterative process of elimination (by payoff dominance and risk dominance relationships) and substitution. For each parameter combination (c, d) a sequence of candidate sets arises which becomes smaller and smaller until finally a candidate set with exactly one equilibrium point — the solution of the game — is found. For the sake of shortness the paper will report results without detailed proofs, which can be found elsewhere [Leopold-Wildburger].     

Value theory without symmetry

We investigate quasi-values of finite games – solution concepts that satisfy the axioms of Shapley (1953) with the possible exception of symmetry.  Following Owen (1972), we define “random arrival', or path, values: players are assumed to “enter' the game randomly, according to independently distributed arrival times, between 0 and 1; the payoff of a player is his expected marginal contribution to the set of players that have arrived before him.  The main result of the paper characterizes quasi-values, symmetric with respect to some coalition structure with infinite elements (types), as random path values, with identically distributed random arrival times for all players of the same type.  General quasi-values are shown to be the random order values (as in Weber (1988) for a finite universe of players).  Pseudo-values (non-symmetric generalization of semivalues) are also characterized, under different assumptions of symmetry. Received: April 1998/Revised version: February 2000     

On non-transferable utility games with coalition structure

We introduce a solution function for Non-transferable Utility (NTU) games when prior coalition structure is given. This solution function generalizes both the Harsanyi solution function forNTU games and the Owen solution forTU games with coalition structure.I would like to thank Sergiu Hart, Bezalel Peleg and Shmuel Zamir for some conversations and constructive remarks on an earlier version of this paper. Part of this research was supported by the Sonderforschungsbereich 303 in the university of Bonn.     

On the difficulty of extending the coco value to games with more than two players

Kalai and Kalai (2013) presented five axioms for solutions of 2-person semi-cooperative games: games in which the basic data specifies individual strategies and payoffs, but in which the players can sign binding contracts and make utility transfers. The axioms pin down a unique solution, the coco value. I show that if one adds a mild dummy player axiom to the list, then the axioms become inconsistent when there are more than two players.     

On bargaining position descriptions in non-transferable utility games

We present a generalization to the Harsanyi solution for non-transferable utility (NTU) games based on non-symmetry among the players. Our notion of non-symmetry is presented by a configuration of weights which correspond to players' relative bargaining power in various coalitions. We show not only that our solution (i.e., the bargaining position solution) generalizes the Harsanyi solution, (and thus also the Shapley value), but also that almost all the non-symmetric generalizations of the Shapley value for transferable utility games known in the literature are in fact bargaining position solutions. We also show that the non-symmetric Nash solution for the bargaining problem is also a special case of our general solution. We use our general representation of non-symmetry to make a detailed comparison of all the recent extensions of the Shapley value using both a direct and an axiomatic approach.     

The consistency principle and an axiomatization of the α-core

This paper examines the α-core of strategic games by means of the consistency principle. I provide a new definition of a reduced game for strategic games. And I define consistency (CONS) and two forms of converse consistency (COCONS and COCONS^*) under this definition of reduced games. Then I axiomatize the α-core for families of strategic games with bounded payoff functions by the axioms CONS, COCONS^*, weak Pareto optimality (WPO) and one person rationality (OPR). Furthermore, I show that these four axioms are logically independent. In proving this, I also axiomatize the α-individually rational solution by CONS, COCONS and OPR for the same families of games. Here the α-individually rational solution is a natural extension of the classical `maximin' solution. Received: June 1998/Final version: 6 July 2001     

Solutions for some bargaining games under the Harsanyi-Selten solution theory,part II: Analysis of specific bargaining games

Part II of the paper (for Part I see Harsanyi (1982)) describes the actual solutions the Harsanyi-Selten solution theory provides for some important classes of bargaining games, such as unanimity games; trade between one seller and several potential buyers; and two-person bargaining games with incomplete information on one side or on both sides. It also discusses some concepts and theorems useful in computing the solution; and explains how our concept of risk dominance enables us to analyze game situations in terms of some intuitively very compelling probabilistic (subjective-probability) considerations disallowed by classical game theory.     

A linear proportional effort allocation rule

This paper proposes a new class of allocation rules in network games. Like the solution theory in cooperative games of how the Harsanyi dividend of each coalition is distributed among a set of players, this new class of allocation rules focuses on the distribution of the dividend of each network. The dividend of each network is allocated in proportion to some measure of each player’s effort, which is called an effort function. With linearity of the allocation rules, an allocation rule is specified by the effort functions. These types of allocation rules are called linear proportional effort allocation rules. Two famous allocation rules, the Myerson value and the position value, belong to this class of allocation rules. In this study, we provide a unifying approach to define the two aforementioned values. Moreover, we provide an axiomatic analysis of this class of allocation rules, and axiomatize the Myerson value, the position value, and their non-symmetric generalizations in terms of effort functions. We propose a new allocation rule in network games that also belongs to this class of allocation rules.     

Axiomatizing the Harsanyi solution,the symmetric egalitarian solution and the consistent solution for NTU-games

The validity of the axiomatization of the Harsanyi solution for NTU-games by Hart (1985) is shown to depend on the regularity conditions imposed on games. Following this observation, we propose two related axiomatic characterizations, one of the symmetric egalitarian solution (Kalai and Samet, 1985) and one of the consistent solution (Maschler and Owen, 1992). The three axiomatic results are studied, evaluated and compared in detail.Revised October 2004We thank an anonymous referee and an associate editor for their helpful comments. Geoffroy de Clippel also thanks Professors Sergiu Hart, Jean-François Mertens and Enrico Minelli. Horst Zank thanks the Dutch Science Foundation NWO and the British Council for support under the UK-Netherlands Partnership Programme in Science (PPS 706). The usual disclaimer applies.     

Extended Curry‐Howard terms for second‐order logic

In order to allow the use of axioms in a second‐order system of extracting programs from proofs, we define constant terms, a form of Curry‐Howard terms, whose types are intended to correspond to those axioms. We also define new reduction rules for these new terms so that all consequences of the axioms can be represented. We finally show that the extended Curry‐Howard terms are strongly normalizable.     

Cardy algebras and sewing constraints,II

This is the part II of a two-part work started in [18]. In part I, Cardy algebras were studied, a notion which arises from the classification of genus-0, 1 open–closed rational conformal field theories. In this part, we prove that a Cardy algebra also satisfies the higher genus factorisation and modular-invariance properties formulated in [7] in terms of the notion of a solution to the sewing constraints. We present the proof by showing that the latter notion, which is defined as a monoidal natural transformation, can be expressed in terms of generators and relations, which correspond exactly to the defining data and axioms of a Cardy algebra.     

Games with a permission structure - A survey on generalizations and applications

In the field of cooperative games with restricted cooperation, various restrictions on coalition formation are studied. The most studied restrictions are those that arise from restricted communication and hierarchies. This survey discusses several models of hierarchy restrictions and their relation with communication restrictions. In the literature, there are results on game properties, Harsanyi dividends, core stability, and various solutions that generalize existing solutions for TU-games. In this survey, we mainly focus on axiomatizations of the Shapley value in different models of games with a hierarchically structured player set, and their applications. Not only do these axiomatizations provide insight in the Shapley value for these models, but also by considering the types of axioms that characterize the Shapley value, we learn more about different network structures. A central model of games with hierarchies is that of games with a permission structure where players in a cooperative transferable utility game are part of a permission structure in the sense that there are players that need permission from other players before they are allowed to cooperate. This permission structure is represented by a directed graph. Generalizations of this model are, for example, games on antimatroids, and games with a local permission structure. Besides discussing these generalizations, we briefly discuss some applications, in particular auction games and hierarchically structured firms.     

The proportional solution for rights problems

Recently there have been several studies to provide axiomatic characterizations of solutions to rights problems. However, these studies do not give a satisfactory answer to the question why the proportional solution is the most widely used. This is the question addressed in this paper. To that purpose, we adopt the axiomatic approach; we suggest a set of axioms which a desirable solution should satisfy and we show that the proportional solution is the only solution to satisfy these axioms. Our main axioms are no advantageous reallocation and additivity. A solution satisfies no advantageous reallocation if no subgroup of claimants ever benefits by transferring parts of their claims between themselves. A solution satisfies additivity if it yields the same allocation whether the total estate is divided at once or in several steps.     

The Nash rationing problem

This paper studies the problem of allocating utility losses among n agents with cardinal non-comparable utility functions. This problem is referred to as the Nash rationing problem, as it can be regarded as the translation of the Nash bargaining problem to a rationing scenario. We show that there is no single-valued solution satisfying the obvious reformulation of Nash’s axioms, nor a multivalued solution satisfying a certain extension of these axioms. However, there is a multivalued solution that is characterised by an appropriate extension of the axioms. We thus call this mapping the Nash rationing solution. It associates with each rationing problem the set of points that maximises a weighted sum of utilities, in which weights are chosen so that all agents’ weighted losses are equal.We are grateful to Carmen Herrero, Paola Manzini, Karl Schlag, William Thomson, Fernando Vega-Redondo and two careful referees for useful comments. Financial support form the Spanish Ministerio de Ciencia y Tecnología, under project SEJ2004-08011ECON, and the Generalitat Valenciana, are gratefuly acknowledged.