Independence Condition Research Articles

Joseph Raz’s Service Conception and the Limits of Knowability

AbstractThis essay criticizes Joseph Raz’s service conception of authority on the basis of its knowability condition. The condition states that for agents to be justified in following authoritative directives, they must be able to know (i.e., form reliable beliefs) that the authority issuing the directives is in fact legitimate. Three grounds for concern are identified. The first is that the satisfaction of the normal justification thesis (NJT), which states that the legitimacy of authorities hinges on whether their directives enable subjects to better conform to reason, only provides agents with reasons to believe that it is justified to act as if an authority were legitimate (i.e., on the assumption that it is). Based on the belief/acceptance distinction, the NJT allows for a gap between what is actually the case and what agents are willing to go along with in order to improve the likelihood of conforming to right reason. The independence condition (IC), which states that for those matters where the NJT obtains it must be better for a subject to improve such conformity than to decide for herself, must be satisfied in conjunction with the NJT, but suffers from its own particular problems. Thus, the second problem identified is that of incommensurable values, which appears when agents are not able to decide between the value of improving right reason—NJT—and the value of deciding for themselves—IC. Finally, the third problem is that of vagueness about right reason, where agents attempting to determine whether an authority meets the two conditions are not able to settle whether reason is improved. Together, these three problem areas of knowability serve to challenge Raz’s position.

ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS

We study systems of parallel queues with finite buffers, a single server with random connectivity to each queue, and arriving job flows with random or class-dependent accessibility to the queues. Only currently connected queues may receive (preemptive) service at any given time, whereas an arriving job can only join one of its accessible queues. Using the coupling method, we study three key models, progressively building from simpler to more complicated structures.In the first model, there are only random server connectivities. It is shown that allocating the server to the Connected queue with the Fewest Empty Spaces (C-FES) stochastically minimizes the number of lost jobs due to buffer overflows, under conditions of independence and symmetry.In the second model, we additionally consider random accessibility of queues by arriving jobs. It is shown that allocating the server to the C-FES and routing each arriving job to the currently Accessible queue with the Most Empty Spaces (C-FES/A-MES) minimizes the loss flow stochastically, under similar assumptions.In the third model (addressing a target application), we consider multiple classes of arriving job flows, each allowed access to a deterministic subset of the queues. Under analogous assumptions, it is again shown that the C-FES/A-MES policy minimizes the loss flow stochastically.The random connectivity/accessibility aspect enhances significantly the structure and application scope of the classical parallel queuing model. On the other hand, it introduces essential additional dynamics and considerable complications. It is interesting that a simple policy like FES/MES, known to be optimal for the classical model, extends to the C-FES/A-MES in our case.