We study the problem of assigning a set of objects to a set of agents, when each agent receives one object and has strict preferences over the objects. In the absence of monetary transfers, we focus on the probabilistic rules, which take the ordinal preferences as input. We characterize the...

We study a probabilistic assignment problem when agents have multi-unit demands for objects. We first introduce two fairness requirements to accommodate different demands across agents. We show that each of these requirements is incompatible with stochastic dominance efficiency (henceforth, we...

We develop a strategic model of network interdiction in a non-cooperative game of flow. A security agency operates a network with arc capacities. An adversary, endowed with a bounded quantity of bads, chooses a flow that specifies a plan for carrying bads through the network from a base to a...