We generalize exactness to games with non-transferable utility (NTU). In an exact game for each coalition there is a core allocation on the boundary of its payoffset. Convex games with transferable utility are well-known to be exact. We study five generalizations of convexity in the NTU setting....

We provide two new characterizations of exact games. First, a game is exact if and only if it is exactly balanced; and second, a game is exact if and only if it is totally balanced and overbalanced.The condition of exact balancedness is identical to the one of balancedness, except that one of the...

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...

A firm has liabilities towards a group of creditors. We analyze the question of how to distribute the asset value of the firm among the creditors and the firm itself. Compared to standard bankruptcy games as studied in the game theory literature, we introduce the firm as an explicit player and...

We introduce a dynamic principal-agent model to understand the nature of contracts between an employer and an independent gig worker. We model the worker’s self-respect with an endogenous participation constraint; he accepts a job offer if and only if its utility is at least as large as his...

We study bankruptcy problems in financial networks in the presence of general bankruptcy laws. The set of clearing payment matrices is shown to be a lattice, which guarantees the existence of a greatest and a least clearing payment. Multiplicity of clearing payment matrices is both a theoretical...

We introduce a dynamic principal-agent model to understand the nature of contracts between an employer and an independent gig worker. We model the worker’s self-respect with an endogenous participation constraint; he accepts a job offer if and only if its utility is at least as large as his...

We study bankruptcy problems in financial networks in the presence of general bankruptcy laws. The set of clearing payment matrices is shown to be a lattice, which guarantees the existence of a greatest and a least clearing payment. Multiplicity of clearing payment matrices is both a theoretical...