Search Results for author:
Found 5 papers, 0 papers with code
Auction-Based Scheduling
Policies express their scheduling urgency using their bids and the bounded budgets ensure long-run scheduling fairness.
Monitoring Algorithmic Fairness under Partial Observations
Moreover, they can monitor only fairness properties that are specified as arithmetic expressions over the probabilities of different events.
Monitoring Algorithmic Fairness
While the frequentist monitors compute estimates that are objectively correct with respect to the ground truth, the Bayesian monitors compute estimates that are correct subject to a given prior belief about the system's model.
Runtime Monitoring of Dynamic Fairness Properties
Our goal is to build and deploy a monitor that will continuously observe a long sequence of events generated by the system in the wild, and will output, with each event, a verdict on how fair the system is at the current point in time.
Symbolic Control for Stochastic Systems via Finite Parity Games
While characterizing the exact satisfaction probability is open, we show that a lower bound on this probability can be obtained by (I) computing an under-approximation of the qualitative winning region, i. e., states from which the parity condition can be enforced almost surely, and (II) computing the maximal probability of reaching this qualitative winning region.
