We develop a strategic model of network interdiction in a non-cooperative game of flow. An adversary, endowed with a bounded quantity of bads, chooses a flow specifying a plan for carrying bads through a network from a base to a target. Simultaneously, an agency chooses a blockage specifying a...

We study the assignment of objects to people via lotteries. We consider the implementation of solutions that are based only on ordinal preferences over the objects. There are three natural ways of comparing lotteries, each of which corresponds to a different notion of Nash equilibrium. For each...

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