We consider rationing problems where the claims are state contingent. Before the state is
realized individuals submit claims for every possible state of the world. A rule distributes …

A comprehensive overview of networks and economic design, presenting models and
results drawn from economics, operations research, and computer science; with examples …

We present a new model for cost sharing in minimum cost spanning tree problems to allow
planners to identify how many agents merge. Under this new framework, in contrast to the …

Consider a sequential process where agents have individual values at every possible step.
A planner is in charge of selecting steps and distributing the accumulated aggregate values …

In the present paper we consider the allocation of costs in connection networks. Agents have
connection demands in form of pairs of locations they want to have connected. Connections …

Agents are endowed with time, which in turn is invested in projects that generate profit. A
mechanism divides the profit generated by these agents depending on the allocation of time …

We provide a framework for the study of the allocation of a divisible resource from a planner
to agents via intermediaries. Intermediaries simultaneously post fees for their services, and …

We study the cake-cutting problem where agents have single-peaked preferences over the
cake. We show that a recently proposed mechanism by Wang and Wu (2019) to obtain envy …

A traditional non-cooperative bargaining situation involves two or more forward-looking
players making offers and counteroffers alternately until an agreement is reached, with a …

Consider the problem of distributing a fixed amount of a divisible resource among agents
whose preferences are single-peaked. The uniform rule has been widely characterized …