Pairing games and markets

Pairing Games or Markets studied here are the non-two-sided NTU generalization of assignment games. We show that the Equilibrium Set is nonempty, that it is the set of stable allocations or the set of semistable allocations, and that it has has several notable structural properties. We also introduce the solution concept of pseudostable allocations and show that they are in the Demand Bargaining Set. We give a dynamic Market Procedure that reaches the Equilibrium Set in a bounded number of steps. We use elementary tools of graph theory and a representation theorem obtained here

Cores of combined games

This paper studies the core of combined games, obtained by summing two coalitional games. It is shown that the set of balanced transferable utility games can be partitioned into equivalence classes of component games whose core is equal to the core of the combined game. On the other hand, for non balanced games, the binary relation associating two component games whose combination has an empty core is not transitive. However, we identify a class of non balanced games which, combined with any other non balanced game, has an empty core.Cooperative games, Core, Additivity, Issue Linkage, Multi Issue Bargaining

Regular Population Monotonic Allocation Schemes and the Core

A subclass of games with population monotonic allocation schemes is studied, namely games with regular population monotonic allocation schemes (rpmas). We focus on the properties of these games and we prove the coincidence between the core and both the Davis-Maschler bargaining set and the Mas-Colell bargaining set.rpmas, bargaining set, pmas, tu-game

Supply chain collaboration

In the past, research in operations management focused on single-firm analysis. Its goal was to provide managers in practice with suitable tools to improve the performance of their firm by calculating optimal inventory quantities, among others. Nowadays, business decisions are dominated by the globalization of markets and increased competition among firms. Further, more and more products reach the customer through supply chains that are composed of independent firms. Following these trends, research in operations management has shifted its focus from single-firm analysis to multi-firm analysis, in particular to improving the efficiency and performance of supply chains under decentralized control. The main characteristics of such chains are that the firms in the chain are independent actors who try to optimize their individual objectives, and that the decisions taken by a firm do also affect the performance of the other parties in the supply chain. These interactions among firms’ decisions ask for alignment and coordination of actions. Therefore, game theory, the study of situations of cooperation or conflict among heterogenous actors, is very well suited to deal with these interactions. This has been recognized by researchers in the field, since there are an ever increasing number of papers that applies tools, methods and models from game theory to supply chain problems

The Maximal Payoff and Coalition Formation in Coalitional Games

This paper first establishes a new core theorem using the concept of generated payoffs: the TU (transferable utility) core is empty if and only if the maximum of generated payoffs (mgp) is greater than the grand coalition’s payoff v(N), or if and only if it is irrational to split v(N). It then provides answers to the questions of what payoffs to split, how to split the payoff, what coalitions to form, and how long each of the coalitions will be formed by rational players in coalitional TU games. Finally, it obtains analogous results in coalitional NTU (non-transferable utility) games.Coalition Formation, Core, Maximal Payoff, Minimum No-Blocking Payoff

Cooperative game theory and its application to natural, environmental, and water resource issues : 1. basic theory

Game theory provides useful insights into the way parties that share a scarce resource may plan their use of the resource under different situations. This review provides a brief and self-contained introduction to the theory of cooperative games. It can be used to get acquainted with the basics of cooperative games. Its goal is also to provide a basic introduction to this theory, in connection with a couple of surveys that analyze its use in the context of environmental problems and models. The main models (bargaining games, transfer utility, and non-transfer utility games) and issues and solutions are considered: bargaining solutions, single-value solutions like the Shapley value and the nucleolus, and multi-value solutions such as the core. The cooperative game theory (CGT) models that are reviewed in this paper favor solutions that include all possible players and ignore the strategic stages leading to coalition building. They focus on the possible results of the cooperation by answering questions such as: Which coalitions can be formed? And how can the coalitional gains be divided to secure a sustainable agreement? An important aspect associated with the solution concepts of CGT is the equitable and fair sharing of the cooperation gains.Environmental Economics&Policies,Economic Theory&Research,Livestock&Animal Husbandry,Education for the Knowledge Economy,Education for Development (superceded)

Markov Equilibria in Dynamic Matching and Bargaining Games

Rubinstein and Wolinsky (1990) show that a simple homogeneous market with exogenous matching has continuum of (non-competitive) perfect equilibria, but the unique Markov perfect equilibrium is competitive. By contrast, in the more general case of heterogeneous markets, we show there exists a continuum of (non-competitive) Markov perfect equilibria. However, a refinement of the Markov property, which we call monotonicity, does suffice to guarantee perfectly competitive equilibria, if, and only if, it is monotonic. The monotonicity property is closely related to the concept of Nash equilibrium with complexity costs

A solution defined by fine vectors

Bumb and Hoede have shown that a cooperative game can be split into two games, the reward game and the fine game, by considering the sign of quantities $c_v^S$ in the c-diagram of the game. One can then define a solution $x$ for the original game as $x = x_r - x_f$ , where $x_r$ is a solution for the reward game and $x_f$ is a solution for the fine game. Due to the distinction of cooperation rewards and fines, for allocating the fines one may use another solution concept than for the rewards. In this paper, a fine vector is introduced and a solution is defined by fine vectors. The structure and properties of this solution are studied. And the solution is characterized as the unique solution having efficiency and f-potential property (resp. f-balanced contributions property)

On the Single-Valuedness of the Pre-Kernel

Based on results given in the recent book by Meinhardt (2013), which presents a dual characterization of the pre-kernel by a finite union of solution sets of a family of quadratic and convex objective functions, we could derive some results related to the uniqueness of the pre-kernel. Rather than extending the knowledge of game classes for which the pre-kernel consists of a single point, we apply a different approach. We select a game from an arbitrary game class with a single pre-kernel element satisfying the non-empty interior condition of a payoff equivalence class, and then establish that the set of related and linear independent games which are derived from this pre-kernel point of the default game replicates this point also as its sole pre-kernel element. In the proof we apply results and techniques employed in the above work. Namely, we prove in a first step that the linear mapping of a pre-kernel element into a specific vector subspace of balanced excesses is a singleton. Secondly, that there cannot exist a different and non-transversal vector subspace of balanced excesses in which a linear transformation of a pre-kernel element can be mapped. Furthermore, we establish that on the restricted subset on the game space that is constituted by the convex hull of the default and the set of related games, the pre-kernel correspondence is single-valued, and therefore continuous. Finally, we provide sufficient conditions that preserve the pre-nucleolus property for related games even when the default game has not a single pre-kernel point.Comment: 24 pages, 2 table

Compromise values in cooperative game theory

Bargaining;game theory