منابع مشابه
Fairness-Free Periodic Scheduling
We consider a problem of repeatedly scheduling n jobs on m parallel machines. Each job is associated with a profit, gained each time the job is completed, and the goal is to maximize the average profit per time unit. Unlike other periodic scheduling problems, there is no fairness requirement. Still, it is impossible to process only the most profitable jobs, because once the processing of a job ...
متن کاملRegret Freedom Isn't Free
Cooperative, peer-to-peer (P2P) services—distributed systems consisting of participants from multiple administrative domains (MAD)—must deal with the threat of arbitrary (Byzantine) failures while incentivizing the cooperation of potentially selfish (rational) nodes that such services rely on to function. This paper investigates how to specify conditions (i.e., a solution concept) for rational ...
متن کاملFairness in Collision-Free WLANs
CSMA/ECA is a contention protocol that makes it possible to construct a collision-free schedule by using a deterministic backoff after successful transmissions. In this paper, we further enhance the CSMA/ECA protocol with two properties that allows to fairly accommodate a large number of contenders in a collision-free schedule. The first property, called hysteresis, instructs the contenders not...
متن کاملEnvy freedom and prior-free mechanism design
We consider the provision of an abstract service to single-dimensional agents. Our model includes position auctions, single-minded combinatorial auctions, and constrained matching markets. When the agents’ values are drawn independently from a distribution, the Bayesian optimal mechanism is given by Myerson [1] as a virtual-surplus optimizer. We develop a framework for prior-free mechanism desi...
متن کاملDecidability of fairness for context-free languages
Trajectories are a powerful tool for de ning the parallel composition of words and languages [8]. One can introduce natural fairness conditions for the shu e operation de ned by a trajectory. It is fairly easy to see that the n-fairness property is decidable for a given context-free language and integer n 1 but the decidability of the corresponding uniform fairness problem remained open. Here w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Law, Ethics and Philosophy
سال: 2018
ISSN: 2341-1465
DOI: 10.31009/leap.2017.v5.05