1
$\begingroup$

There are definitions of Absolute, Strong and Weak Fairness available across the internet, but I cannot find a definition of "K-Fairness" property for critical section algorithms (also algorithms that satisfy a 1-fairness or 3-fairness property). Does this actually exist or is this something that was made up to describe a phenomenon that I am not recognizing?

$\endgroup$
1
$\begingroup$

Perhaps you should look for "bounded fairness", the property that something happens within the next $k$ times, where $k$ is the bound.

$\endgroup$
0
$\begingroup$

It should refer the paper: Ryan Porter, Yoav Shoham and Moshe Tennenholtz, "Fair imposition", Journal of Economic Theory 118(2):209–228, 2004. (doi, Science Direct)

$\endgroup$
  • 1
    $\begingroup$ Could you summarize the definition from the article, and explain how it answers the original question? ScienceDirect is a paywalled site, and even some very large computing organizations and universities don't have subscriptions (especially since that's an economics journal). So all that many of us can see is the abstract. $\endgroup$ – Wandering Logic Sep 29 '14 at 21:26
  • $\begingroup$ What should refer to this paper? $\endgroup$ – David Richerby Sep 29 '14 at 21:58

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.