Priority monism

Argument that priority monism is best understood as being a contingent thesis

The priority view

According to the priority view, or prioritarianism, it matters more to benefit people the worse off they are. But how exactly should the priority view be defined? This article argues for a highly general characterization which essentially involves risk, but makes no use of evaluative measurements or the expected utility axioms. A representation theorem is provided, and when further assumptions are added, common accounts of the priority view are recovered. A defense of the key idea behind the priority view, the priority principle, is provided. But it is argued that the priority view fails on both ethical and conceptual grounds

Performance comparison of several priority schemes with priority jumps

A

The MVA Priority Approximation

A Mean Value Analysis (MVA) approximation is presented for computing the average performance measures of closed-, open-, and mixed-type multiclass queuing networks containing Preemptive Resume (PR) and nonpreemptive Head-Of-Line (HOL) priority service centers. The approximation has essentially the same storage and computational requirements as MVA, thus allowing computationally efficient solutions of large priority queuing networks. The accuracy of the MVA approximation is systematically investigated and presented. It is shown that the approximation can compute the average performance measures of priority networks to within an accuracy of 5 percent for a large range of network parameter values. Accuracy of the method is shown to be superior to that of Sevcik's shadow approximation

Efficient Priority Rules

We study the assignment of indivisible objects with quotas (houses, jobs, or offices) to a set of agents (students, job applicants, or professors). Each agent receives at most one object and monetary compensations are not possible. We characterize efficient priority rules by efficiency, strategy-proofness, and renegotiation-proofness. Such a rule respects an acyclical priority structure and the allocations can be determined using the deferred acceptance algorithm.acyclical priority structures, indivisible objects

Pattern classes and priority queues

When a set of permutations comprising a pattern class C is submitted as input to a priority queue the resulting output is again a pattern class C'. The basis of C' is determined for pattern classes C whose basis elements have length 3, and is finite in these cases. An example is given of a class C with basis 2431 for which C is not finitely based