We study self-interested routing in stochastic networks, taking into account the discrete stochastic dynamics of such networks. We analyze a two station multiclass queueing network in which the system manager chooses the scheduling rule used, and individual customers choose routes in a...

We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing time. They make bids upon arrival at a queue whose length is unobservable. We consider two bidding schemes that...

In this article, a market for access to trading partners arises through the operation of a competitive market in which consumers queue for goods at firms. Equilibrium occurs when firms and buyers face the same trade-off between price and wait time. The trade-off measures the cost to firms of...

We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue. We assume that the agents collaborate in order to achieve an efficient outcome for society. We allow for side-payments and provide a method for obtaining...

We study both theoretically and experimentally the decisions players make in two queueing games with batch service. In both games, players are asked to independently decide when to join a discrete-time queue to receive service, or they may simply choose not to join it at all. Equilibrium...

In this thesis, we study the repair shop scheduling problem(repair-to-stock) and the production/inventory system pricing and production scheduling problem(make-to-stock). For both types of problems, we compare the performance of different scheduling policies. For the make-to-stock type problem,...