Discounted Tree Solutions

This article introduces a discount parameter and a weight function in Myerson's (1977) classical model of cooperative games with restrictions on cooperation. The discount parameter aims to reflect the time preference of the agents while the weight function aims to reflect the importance of each node of a graph. We provide axiomatic characterizations of two types of solution that are inspired by the hierarchical outcomes (Demange, 2004)

Recursive and bargaining values

We introduce two families of values for TU-games: the recursive and bargaining values. Bargaining values are obtained as the equilibrium payoffs of the symmetric non-cooperative bargaining game proposed by Hart and Mas-Colell (1996). We show that bargaining values have a recursive structure in their definition, and we call this property recursiveness. All efficient, linear, and symmetric values that satisfy recursiveness are called recursive values. We generalize the notions of potential, and balanced contributions property, to characterize the family of recursive values. Finally, we show that if a time discount factor is considered in the bargaining model, every bargaining value has its corresponding discounted bargaining value

A strategic approach for the discounted Shapley values

The family of discounted Shapley values is analyzed for cooperative games in coalitional form. We consider the bargaining protocol of the alternating random proposer introduced in Hart and Mas-Colell (Econometrica 64:357-380, 1996). We demonstrate that the discounted Shapley values arise as the expected payoffs associated with the bargaining equilibria when a time discount factor is considered. In a second model, we replace the time cost with the probability that the game ends without agreements. This model also implements these values in transferable utility games, moreover, the model implements the α-consistent values in the nontransferable utility setting

A Strategic Implementation of the Average Tree Solution for Cycle-Free Graph Games

In this note we provide a strategic implementation of the Average Tree solution for zero-monotonic cycle-free graph games. That is, we propose a non-cooperative mechanism of which the unique subgame perfect equilibrium payoffs correspond to the average hierarchical outcome of the game. This mechanism takes into account that a player is only able to communicate with other players (i.e., to make proposals about a division of the surplus of cooperation) when they are connected in the graph. © 2013 Elsevier Inc

Game theory approach to competitive economic dynamics

This thesis deals both with non-cooperative and cooperative games in order to apply the mathematical theory to competitive dynamics arising from economics, particularly quantity competition in oligopolies and pollution reduction models in IEA (International Environmental Agreements)

Game theory

game theory

Game theory approach to competitive economic dynamics

This thesis deals both with non-cooperative and cooperative games in order to apply the mathematical theory to competitive dynamics arising from economics, particularly quantity competition in oligopolies and pollution reduction models in IEA (International Environmental Agreements)