Fairness as a Program Property

نویسندگان

  • Aws Albarghouthi
  • Loris D'Antoni
  • Samuel Drews
  • Aditya V. Nori
چکیده

We explore the following question: Is a decision-making program fair, for some useful definition of fairness? First, we describe how several algorithmic fairness questions can be phrased as program verification problems. Second, we discuss an automated verification technique for proving or disproving fairness of decision-making programs with respect to a model of the population.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cooperative Benefit and Cost Games under Fairness Concerns

Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...

متن کامل

Fair enumeration combinators

Enumerations represented as bijections between the natural numbers and elements of some given type have recently garnered interest in property-based testing because of their efficiency and flexibility. There are, however, many ways of defining these bijections, some of which are better than others. This paper offers a new property of enumeration combinators called fairness that identifies enume...

متن کامل

\Direct" Model Checking of Temporal Properties

In this paper, we address the problem of model checking temporal properties of nite-state programs. This problem is usually solved by modelling the program as well as the negation of the desired temporal property as automata on in nite words (B uchi automata) and checking for emptiness of the automaton resulting from the synchronous product of the program automaton and the negated property aut...

متن کامل

Direct Model Checking of Temporal

In this paper, we address the problem of model checking temporal properties of nite-state programs. This problem is usually solved by modelling the program as well as the negation of the desired temporal property as automata on innnite words (B uchi automata) and checking for emptiness of the automaton resulting from the synchronous product of the program automaton and the negated property auto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1610.06067  شماره 

صفحات  -

تاریخ انتشار 2016