Showing 1 - 10 of 133
We consider a situation in which agents have mutual claims on each other, summarized in a liability matrix. Agents … prevailing bankruptcy rules that satisfies limited liability and priority of creditors. Since clearing payment matrices and the …
Persistent link: https://www.econbiz.de/10012936525
In cooperative games, the coalition structure core is, despite its potential emptiness, one of the most popular solutions. While it is a fundamentally static concept, the consideration of a sequential extension of the underlying dominance correspondence gave rise to a selection of non-empty...
Persistent link: https://www.econbiz.de/10014095868
We adapt the core concept to deal with economies in which trade in assets takes place at period 1, uncertainty about asset payoffs is released at period 2, and agents trade in commodities afterwards. We define the weak sequential core as the set of allocations that are stable against coalitional...
Persistent link: https://www.econbiz.de/10014119037
The literature on the computation of Nash equilibria in n-person games is dominated by simplicial methods. This paper is the first to introduce a globally convergent algorithm that fully exploits the differentiability present in the problem. It presents an everywhere differentiable homotopy to...
Persistent link: https://www.econbiz.de/10014151872
literature, we introduce the firm as an explicit player and define a new class of transferable utility games called liability … games. Liability games are superadditive, constant sum, partially convex, and partially concave. The core of a liability …
Persistent link: https://www.econbiz.de/10012940904
Harsanyi and Selten (1988) have proposed a theory of equilibrium selection that selects a unique Nash equilibrium for any non-cooperative N-person game. The heart of their theory is given by the tracing procedure, a mathematical construction that adjusts arbitrary prior beliefs into equilibrium...
Persistent link: https://www.econbiz.de/10014208855
In this paper an algorithm is presented to compute all Nash equilibria for games in normal form on the only premises that the number of Nash equilibria is finite. The algorithm relies on decomposing the game by means of support-sets. For each support-set, the set of totally mixed equilibria of...
Persistent link: https://www.econbiz.de/10014090468
We consider cooperative games with transferable utility (TU-games), in which we allow for a social structure on the set of players. The social structure is utilized to refine the core of the game. For every coalition the relative strength of a player within that coalition is induced by the...
Persistent link: https://www.econbiz.de/10014029351
We study cooperative games with communication structure, represented by an undirected graph. Players in the game are able to cooperate only if they can form a network in the graph. A single-valued solution, the average tree solution, is proposed for this class of games. Given the graph structure...
Persistent link: https://www.econbiz.de/10010325870
This paper studies coalition formation among individuals who differ in productivity. The output of a coalition is determined by the sum of the productivities and the size of the coalition. We consider egalitarian societies in which coalitions split their surplus equally and individualistic...
Persistent link: https://www.econbiz.de/10012838321