Uncoupled Aspiration Adaptation Dynamics Into the Core

2019 ◽  
Vol 20 (2) ◽  
pp. 243-256 ◽  
Author(s):  
Heinrich H. Nax
Keyword(s):  
Finite Time ◽  
Cooperative Games ◽  
Transferable Utility ◽  
The Core ◽  
Best Response ◽  
Dynamic Blocking ◽  
Evolutionary Interpretation ◽  
Require Information ◽  
Empty Core

Abstract Dynamics for play of transferable-utility cooperative games are proposed that require information regarding own payoff experiences and other players’ past actions, but not regarding other players’ payoffs. The proposed dynamics provide an evolutionary interpretation of the proto-dynamic ‘blocking argument’ (Edgeworth, 1881) based on the behavioral principles of ‘aspiration adaptation’ (Sauermann and Selten, 1962) instead of best response. If the game has a non-empty core, the dynamics are absorbed into the core in finite time with probability one. If the core is empty, the dynamics cycle infinitely through all coalitions.

scholarly journals Hart–Mas-Colell consistency and the core in convex games

2021 ◽  
Author(s):  
Bas Dietzenbacher ◽  
Peter Sudhölter
Keyword(s):  
Shapley Value ◽  
Cooperative Games ◽  
Individual Rationality ◽  
Transferable Utility ◽  
Convex Games ◽  
The Core ◽  
The Shapley Value ◽  
Scale Covariance

AbstractThis paper formally introduces Hart–Mas-Colell consistency for general (possibly multi-valued) solutions for cooperative games with transferable utility. This notion is used to axiomatically characterize the core on the domain of convex games. Moreover, we characterize all nonempty solutions satisfying individual rationality, anonymity, scale covariance, superadditivity, weak Hart–Mas-Colell consistency, and converse Hart–Mas-Colell consistency. This family consists of (a) the Shapley value, (b) all homothetic images of the core with the Shapley value as center of homothety and with positive ratios of homothety not larger than one, and (c) their relative interiors.

STABILITY OF THE CORE IN A CLASS OF NTU GAMES: A CHARACTERIZATION

2002 ◽  
Vol 04 (02) ◽  
pp. 165-172 ◽  
Author(s):  
ANINDYA BHATTACHARYA ◽  
AMIT K. BISWAS
Keyword(s):  
Cooperative Games ◽  
Stable Set ◽  
Regularity Conditions ◽  
Transferable Utility ◽  
Large Core ◽  
Von Neumann ◽  
Ntu Games ◽  
The Core ◽  
Important Solution ◽  
Transferable Utility Games

The core and the stable set are possibly the two most crucially important solution concepts for cooperative games. The relation between the two has been investigated in the context of symmetric transferable utility games and this has been related to the notion of large core. In this paper the relation between the von-Neumann–Morgenstern stability of the core and the largeness of it is investigated in the case of non-transferable utility (NTU) games. The main findings are that under certain regularity conditions, if the core of an NTU game is large then it is a stable set and for symmetric NTU games the core is a stable set if and only if it is large.

scholarly journals Maximizing the Minimal Satisfaction—Characterizations of Two Proportional Values

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1129
Author(s):  
Wenzhong Li ◽  
Genjiu Xu ◽  
Hao Sun
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Cooperative Games ◽  
Transferable Utility ◽  
Payoff Vector ◽  
The Core ◽  
Proportional Allocation ◽  
Consistency Property ◽  
Associated Consistency

A class of solutions are introduced by lexicographically minimizing the complaint of coalitions for cooperative games with transferable utility. Among them, the nucleolus is an important representative. From the perspective of measuring the satisfaction of coalitions with respect to a payoff vector, we define a family of optimal satisfaction values in this paper. The proportional division value and the proportional allocation of non-separable contribution value are then obtained by lexicographically maximizing two types of satisfaction criteria, respectively, which are defined by the lower bound and the upper bound of the core from the viewpoint of optimism and pessimism respectively. Correspondingly, we characterize these two proportional values by introducing the equal minimal satisfaction property and the associated consistency property. Furthermore, we analyze the duality of these axioms and propose more approaches to characterize these two values on basis of the dual axioms.

scholarly journals THE POSITIVE PREKERNEL OF A COOPERATIVE GAME

2000 ◽  
Vol 02 (04) ◽  
pp. 287-305 ◽  
Author(s):  
PETER SUDHÖLTER ◽  
BEZALEL PELEG
Keyword(s):  
Cooperative Game ◽  
Weak Version ◽  
Transferable Utility ◽  
Bargaining Set ◽  
The Core ◽  
Reduced Game ◽  
Positive Kernel ◽  
Game Property ◽  
Transferable Utility Games

The positive prekernel, a solution of cooperative transferable utility games, is introduced. We show that this solution inherits many properties of the prekernel and of the core, which are both sub-solutions. It coincides with its individually rational variant, the positive kernel, when applied to any zero-monotonic game. The positive (pre)kernel is a sub-solution of the reactive (pre)bargaining set. We prove that the positive prekernel on the set of games with players belonging to a universe of at least three possible members can be axiomatized by non-emptiness, anonymity, reasonableness, the weak reduced game property, the converse reduced game property, and a weak version of unanimity for two-person games.

On the core, nucleolus and bargaining sets of cooperative games with fuzzy payoffs

2019 ◽  
Vol 36 (6) ◽  
pp. 6129-6142 ◽  
Author(s):  
Xia Zhang ◽  
Hao Sun ◽  
Genjiu Xu ◽  
Dongshuang Hou
Keyword(s):  
Cooperative Games ◽  
The Core ◽  
Bargaining Sets

LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES

2002 ◽  
Vol 13 (05) ◽  
pp. 653-666 ◽  
Author(s):  
Qizhi Fang ◽  
Shanfeng Zhu
Keyword(s):  
Integer Programming ◽  
Cooperative Game ◽  
Cooperative Games ◽  
Value Function ◽  
Linear Program ◽  
Grand Coalition ◽  
The Core ◽  
Programming Techniques ◽  
Theoretical Results

Let Γ = (N, v) be a cooperative game with the player set N and value function v : 2N → R. A solution of the game is in the core if no subset of players could gain advantage by breaking away from the grand coalition of all players. This paper surveys theoretical results on the cores for some cooperative game models. These results proved that the linear program duality characterization of the core is a very powerful tool. We will focus on linear and integer programming techniques applied in this area.

AN AXIOM SYSTEM FOR A VALUE FOR GAMES IN PARTITION FUNCTION FORM

2005 ◽  
Vol 07 (01) ◽  
pp. 63-72 ◽  
Author(s):  
M. J. ALBIZURI ◽  
J. ARIN ◽  
J. RUBIO
Keyword(s):  
Partition Function ◽  
Shapley Value ◽  
Cooperative Games ◽  
Axiom System ◽  
Axiomatic Characterization ◽  
Transferable Utility ◽  
Function Form ◽  
A Value ◽  
The Shapley Value ◽  
Partition Function Form

Lucas and Trall (1963) defined the games in partition function form as a generalization of the cooperative games with transferable utility. In our work we propose by means of an axiomatic characterization a solution for such games in partition function form. This solution will be a generalization of the Shapley value (1953).

Sign in / Sign up

Export Citation Format

Share Document