We introduce a new family of cooperative games for which there is coincidence between the nucleolus and the Shapley value. These so-called clique games are such that agents are divided into cliques, with the value created by a coalition linearly increasing with the number of agents belonging to...

We introduce a new family of cooperative games for which there is coincidence between the nucleolus and the Shapley value. These so-called clique games are such that agents are divided into cliques, with the value created by a coalition linearly increasing with the number of agents belonging to...

We study cost-sharing rules in network problems where agents seek to ship quantities of some good to their respective locations, and the cost on each arc is linear in the flow crossing it. In this context, Core Selection requires that each subgroup of agents pay a joint cost share that is not...

We study three remarkable cost sharing rules in the context of shortest path problems, where agents have demands that can only be supplied by a source in a network. The demander rule requires each demander to pay the cost of their cheapest connection to the source. The supplier rule charges to...

This paper studies matching markets in the presence of middlemen. In our framework, a buyer–seller pair may either trade directly or use the services of a middleman; and a middleman may serve multiple buyer–seller pairs. For each such market, we examine the associated TU game. We first show...