Results 1  10
of
22
Fairness and efficiency in web server protocols
 SIGMETRICS Perform. Eval. Rev
, 2003
"... We consider the problem of designing a preemptive protocol that is both fair and efficient when one is only concerned with the sojourn time of the job and not intermediate results. Our Fair Sojourn Protocol (FSP) is both efficient, in a strong sense (similar to the shortest remaining processing time ..."
Abstract

Cited by 38 (1 self)
 Add to MetaCart
(Show Context)
We consider the problem of designing a preemptive protocol that is both fair and efficient when one is only concerned with the sojourn time of the job and not intermediate results. Our Fair Sojourn Protocol (FSP) is both efficient, in a strong sense (similar to the shortest remaining processing time protocol: SRPT), and fair, in the sense of guaranteeing that it weakly outperforms processor sharing (PS) for every job on any sample path. Our primary motivation is web serving in which the standard protocol is PS, while recent work proposes using SRPT or variants. Our work suggests both a framework in which to evaluate proposed protocols and an attractive new protocol, FSP.
Social Welfare Functionals and Interpersonal Comparability
, 2001
"... This chapter reviews the SWFL approach to social choice. It does not attempt to be a complete and systematic survey of existing results,but to give a critical assesment of the main axioms and their role in filtering the ethically relevant information,in particular the measurability and comparability ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
This chapter reviews the SWFL approach to social choice. It does not attempt to be a complete and systematic survey of existing results,but to give a critical assesment of the main axioms and their role in filtering the ethically relevant information,in particular the measurability and comparability properties of individual evaluation functions. Social welfare functionals are defined formally together with closely related concepts. After adducing a good number of examples,we elaborate on the meaning of the SWFL domain of definition and we sketch some alternative approaches. Several types of axioms are considered; some of them are used to filter the relevant information while others express collective efficiency or equity requirements. Then,to illustrate the various tradeoffs among these axioms,selected characterisation results are presented; most of them are cast in what we call the formally welfarist framework. Finally, we have assembled some other characterisations which eschew either invariance properties or the formally welfarist framework. We discuss the treatment of two sets of social alternatives endowed with an enriched structure,viz. the set of classical exchange economies and the complete set of lotteries one can define on an abstract set of pure alternatives. As an introduction to the latter discussion,we elaborate on the difficulties raised by social evaluation when risks and uncertainty are taken explicitly into account.
Nonmanipulable division rules in claims problems and generalizations
, 2005
"... When resources are divided among agents, the characteristics of the agents are taken into consideration. A simple example is the bankruptcy problem, where the liquidation value of a bankrupt firm is divided among the creditors based on their claims. We characterize division rules under which no grou ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
(Show Context)
When resources are divided among agents, the characteristics of the agents are taken into consideration. A simple example is the bankruptcy problem, where the liquidation value of a bankrupt firm is divided among the creditors based on their claims. We characterize division rules under which no group of agents can increase the total amount they receive by transferring their characteristics within the group. By allowing agents ’ characteristics to be multidimensional and choosing the meaning of variables appropriately, our model can subsume a number of existing and new allocation problems, such as cost sharing, social choice with transferable utilities, income redistribution, bankruptcy with multiple types of assets, probability updating, and probability aggregation. A number of existing and new results in specific problems are obtained as corollaries.
Voting over piecewise linear tax methods
"... We analyze the problem of choosing the most appropriate method for apportioning taxes in a democracy. We consider a simple model of taxation and restrict our attention to piecewise linear tax methods, which are almost ubiquitous in advanced democracies worldwide. In spite of facing an impossibility ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
We analyze the problem of choosing the most appropriate method for apportioning taxes in a democracy. We consider a simple model of taxation and restrict our attention to piecewise linear tax methods, which are almost ubiquitous in advanced democracies worldwide. In spite of facing an impossibility result saying that if we allow agents to vote for any piecewise linear tax method no equilibrium exists, we show that if we limit the domain of admissible methods in a meaningful way, albeit not restrictive, an equilibrium does exist. We also show that, for such a domain, a wide variety of methods can be supported in equilibrium. This last result provides rationale for some activities of special interest groups. JEL numbers: D72, H24.
A NonCooperative Support for Equal Division in Estate Division Problems ∗
"... We consider estate division problems and show that for any claim game based on a (estate division) rule satisfying efficiency, equal treatment of equals, and order preservation of awards, all (pure strategy) Nash equilibria induce equal division. Next, we consider (estate division) rules satisfying ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We consider estate division problems and show that for any claim game based on a (estate division) rule satisfying efficiency, equal treatment of equals, and order preservation of awards, all (pure strategy) Nash equilibria induce equal division. Next, we consider (estate division) rules satisfying efficiency, equal treatment of equals, and claims monotonicity. Then, for claim games with at most three agents, again all Nash equilibria induce equal division. Surprisingly, this result does not extend to claim games with more than three agents. However, if nonbossiness is added, then equal division is restored.
On Probabilistic Rationing Methods
, 2002
"... Rationing occurs if the demand for a certain good exceeds its supply. In such situations a rationing method has to be specified in order to determine the allocation of the scarce good to the agents. Moulin (1999) introduced the notion of probabilistic rationing methods for the discrete framework. In ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Rationing occurs if the demand for a certain good exceeds its supply. In such situations a rationing method has to be specified in order to determine the allocation of the scarce good to the agents. Moulin (1999) introduced the notion of probabilistic rationing methods for the discrete framework. In this paper we establish a link between classical and probabilistic rationing methods. In particular, we assign to any given classical rationing method a probabilistic rationing method with minimal variance among those probabilistic rationing methods, which result in the same expected distributions as the given classical rationing method.
Progressivity, inequality reduction and mergingproofness
, 2006
"... Progressivity, inequality reduction and mergingproofness are three wellknown axioms in taxation. We investigate implications of each of the three axioms through characterizations of several families of taxation rules and their logical relations. We also study the preservation of these axioms unde ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Progressivity, inequality reduction and mergingproofness are three wellknown axioms in taxation. We investigate implications of each of the three axioms through characterizations of several families of taxation rules and their logical relations. We also study the preservation of these axioms under two operators on taxation rules, the socalled convexity operator and minimalburden operator, which give intuitive procedures of determining a tax schedules.
On the equivalence between progressive taxation and inequality reduction
, 2007
"... We establish the precise connections between progressive taxation and inequality reduction, in a setting where the level of tax revenue to be raised is endogenously …xed and tax schemes are balanced. We show that, in contrast with the traditional literature on taxation, the equivalence between inequ ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We establish the precise connections between progressive taxation and inequality reduction, in a setting where the level of tax revenue to be raised is endogenously …xed and tax schemes are balanced. We show that, in contrast with the traditional literature on taxation, the equivalence between inequality reduction and the combination of progressivity and income order preservation does not always hold in this setting. However, we show that, among rules satisfying consistency and, either revenue continuity, or revenue monotonicity, the equivalence remains intact.
Fairness and Efficiency in Processor Sharing Protocols to Minimize Sojourn Times
, 2002
"... We consider the problem of designing a preemptive protocol that is both fair and efficient when one is only concerned with the sojourn time of the job and not intermediate results. Our Fair Sojourn Protocol (FSP) is both efficient, in a strong sense (similar to the shortest remaining processing tim ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the problem of designing a preemptive protocol that is both fair and efficient when one is only concerned with the sojourn time of the job and not intermediate results. Our Fair Sojourn Protocol (FSP) is both efficient, in a strong sense (similar to the shortest remaining processing time protocol – SRPT), and fair, in the sense of guaranteeing that it outperforms processor sharing (PS) for every nonterminal job in every busy period for any sample path while providing the same performance for the terminal job. Our primary motivation is web serving in which the standard protocol is PS, while recent work proposes using SRPT or variants. Our work suggests both a framework in which to evaluate proposed protocols and an attractive new protocol, FSP.