Convex and exact games with non-transferable utility

We generalize exactness to games with non-transferable utility (NTU). A game is exact if for each coalition there is a core allocation on the boundary of its payoff set. Convex games with transferable utility are well-known to be exact. We consider ve generalizations of convexity in the NTU setting. We show that each of ordinal, coalition merge, individual merge and marginal convexity can be uni¯ed under NTU exactness. We provide an example of a cardinally convex game which is not NTU exact. Finally, we relate the classes of Π-balanced, totally Π-balanced, NTU exact, totally NTU exact, ordinally convex, cardinally convex, coalition merge convex, individual merge convex and marginal convex games to one another.

Stochastic bankruptcy games

We study bankruptcy games where the estate and the claims have stochastic values. We use the Weak Sequential Core as the solution concept for such games. We test the stability of a number of well known division rules in this stochastic setting and find that most of them are unstable, except for the Constrained Equal Awards rule, which is the only one belonging to the Weak Sequential Core.

Transferable Utility Games with Uncertainty

We introduce the concept of a TUU-game, a transferable utility game with uncertainty. In a TUU-game there is uncertainty regarding the payoffs of coalitions. One out of a finite number of states of nature materializes and conditional on the state, the players are involved in a particular transferable utility game. We consider the case without ex ante commitment possibilities and propose the Weak Sequential Core as a solution concept. We characterize the Weak Sequential Core and show that it is non-empty if all ex post TUgames are convex.

Transferable Utility Games with Uncertainty

We introduce the concept of a TUU-game, a transferableutilitygame with uncertainty. In a TUU-game there is uncertainty regarding the payoffs of coalitions. One out of a finite number of states of nature materializes and conditional on the state, the players are involved in a particular transferableutilitygame. We consider the case without ex ante commitment possibilities and propose the Weak Sequential Core as a solution concept. We characterize the Weak Sequential Core and show that it is non-empty if all ex post TU-games are convex.

A Note on The Weak Sequential Core of Dynamic TU Games

This paper addresses a problem with an argument in Kranich, Perea, and Peters (2005) supporting their definition of the Weak Sequential Core and their characterization result. We also provide the remedy, a modification of the definition, to rescue the characterization.

Cooperation under incomplete contracting

We examine the notion of the core when cooperation takes place in a setting with time and uncertainty. We do so in a two-period general equilibrium setting with incomplete markets. Market incompleteness implies that players cannot make all possible binding commitments regarding their actions at different date-events. We unify various treatments of dynamic core concepts existing in the literature. This results in definitions of the Classical Core, the Segregated Core, the Two-stage Core, the Strong Sequential Core, and the Weak Sequential Core. Except for the Classical Core, all these concepts can be defined by requiring absence of blocking in period 0 and at any date-event in period 1. The concepts only differ with respect to the notion of blocking in period 0. To evaluate these concepts, we study three market structures in detail: strongly complete markets, incomplete markets in finance economies, and incomplete markets in settings with multiple commodities.

Decentralized Clearing in Financial Networks

We consider a situation in which agents have mutual claims on each other, summarized in a liability matrix. Agents' assets might be insufficient to satisfy their liabilities leading to defaults. In case of default, bankruptcy rules are used to specify the way agents are going to be rationed. A clearing payment matrix is a payment matrix consistent with the prevailing bankruptcy rules that satisfies limited liability and priority of creditors. Since clearing payment matrices and the corresponding values of equity are not uniquely determined, we provide bounds on the possible levels equity can take. Unlike the existing literature, which studies centralized clearing procedures, we introduce a large class of decentralized clearing processes. We show the convergence of any such process in finitely many iterations to the least clearing payment matrix. When the unit of account is sufficiently small, all decentralized clearing processes lead essentially to the same value of equity as a centralized clearing procedure. As a policy implication, it is not necessary to collect and process all the sensitive data of all the agents simultaneously and run a centralized clearing procedure.