queueing and sequencing problems. We find that in case of queueing problems, Efficient allocation rules are Rawlsian but the …

Learning curves can arise out of routing problems, or out of sequencing problems, or a combination of both. In this … properties of the learning curves arising out of sequencing problems are analyzed by means of a computational model. In both …

strategies. Given this impossibility, we try to implement simple sequencing problems in ex-post equilibrium. We show that a … for implementable n agent simple sequencing problems, with polynomial cost function of order (n-2) or less, one can … achieve first best implementability. Moreover, for the class of simple sequencing problems with ``sufficiently well behaved …

strategies. Given this impossibility, we try to implement simple sequencing problems in ex-post equilibrium. We show that a … for implementable n agent simple sequencing problems, with polynomial cost function of order (n-2) or less, one can … achieve first best implementability. Moreover, for the class of simple sequencing problems with ``sufficiently well behaved …

strategies. Given this impossibility, we try to implement simple sequencing problems in ex-post equilibrium. We show that a … for implementable n agent simple sequencing problems, with polynomial cost function of order (n-2) or less, one can … achieve first best implementability. Moreover, for the class of simple sequencing problems with "sufficiently well behaved …

and budget balancedness. In this paper we show that among a more general and natural class of sequencing problems …, sequencing problems with linear cost is the only class for which first best can be achieved. …