A group of agents are waiting for their job to be processed in a facility. We assume that each agent needs the same amount of processing time and incurs waiting costs. The facility has two parallel servers, being able to serve two agents at a time. We are interested in finding the order to serve...

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 investigate the implications of imposing balanced consistency and balanced cost reduction in the context of sequencing problems. Balanced consistency requires that the effect on the payoff from the departure of one agent to another agent should be equal between any two agents. On the other...