No article text was recorded for this version.
ex-ante fairness
Version 1 of 1149 papers211 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Fairness in Influence Maximization through Randomization
- Blog: Fair Disaster Containment via Graph-Cut Problems
- Blog: Online Max-min Fair Allocation
- Blog: Assigning Course Schedules: About Preference Elicitation, Fairness, and Truthfulness
- Blog: Scarce Resource Allocations That Rely On Machine Learning Should Be Randomized
- Blog: KFC: A Scalable Approximation Algorithm for $k$-center Fair Clustering
- Blog: When Can the Maximin Share Guarantee Be Guaranteed?
- Blog: Interim envy-freeness: A new fairness concept for random allocations
- Blog: Leximax Approximations and Representative Cohort Selection
- Blog: On Interim Envy-Free Allocation Lotteries
- Blog: On the Cost of Demographic Parity in Influence Maximization
- Blog: Group Fairness in Set Packing Problems
- Blog: Achieving Long-term Fairness in Submodular Maximization through Randomization
- Blog: Position: Scarce Resource Allocations That Rely On Machine Learning Should Be Randomized
- Blog: Greedily Maximizing Ex-Ante Fairness
- Blog: Best of Both Worlds: Ex Ante and Ex Post Fairness in Resource Allocation
- Blog: Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms
- Blog: A Lottery Model for Center-type Problems With Outliers
- Blog: Fairness in Matching under Uncertainty
- Blog: Fair Lotteries for Participatory Budgeting
- Blog: Envy-Free Classification
- Blog: Constrained Fair and Efficient Allocations
- Blog: Beyond Cake Cutting: Allocating Homogeneous Divisible Goods
- Blog: The crawler: Three equivalence results for object (re)allocation problems when preferences are single-peaked
- Blog: Fair Disaster Containment via Graph-Cut Problems
- Blog: Beyond Submodularity: A Unified Framework of Randomized Set Selection with Group Fairness Constraints
- Blog: Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations
- Blog: Envy-Free Classification
- Blog: Truth, Justice, and Cake Cutting
- Blog: Fair-by-design algorithms: matching problems and beyond
- Blog: Equity Promotion in Public Transportation
- Blog: Computational Aspects of Assigning Agents to a Line
- Blog: Improving Approximation Guarantees for Maximin Share
- Blog: On the existence of Pareto Efficient and envy-free allocations
- Blog: Individual Fairness in Kidney Exchange Programs
- Blog: Random Matching under Priorities: Stability and No Envy Concepts
- Blog: On the Max-Min Fair Stochastic Allocation of Indivisible Goods
- Blog: Individual Fairness under Group Fairness Constraints in Bipartite Matching - One Framework to Approximate Them All
- Blog: Improved Algorithms for Fair Matroid Submodular Maximization
- Blog: Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations
- Blog: Improving Approximation Guarantees for Maximin Share
- Blog: Best-of-Both-Worlds Fairness in Committee Voting
- Blog: Fair and Truthful Mechanisms for Dichotomous Valuations
- Blog: Fairness in graph-theoretical optimization problems
- Blog: Reducing Leximin Fairness to Utilitarian Optimization
- Blog: Fair and Efficient Resource Allocation with Partial Information
- Blog: Attainability and Optimality: The Equalized-Odds Fairness Revisited
- Blog: On the Existence of Pareto Efficient and Envy Free Allocations
- Blog: First-Choice Maximality Meets Ex-ante and Ex-post Fairness
- Blog: Reducing Leximin Fairness to Utilitarian Optimization
- Blog: District-Fair Participatory Budgeting
- Blog: Fair-by-design matching
- Blog: Fair Lotteries for Participatory Budgeting
- Blog: Online Fair Division: Towards Ex-Post Constant MMS Guarantees
- Blog: Group-level Fairness Maximization in Online Bipartite Matching
- Blog: Using Protected Attributes to Consider Fairness in Multi-Agent Systems
- Blog: Simultaneous Approximation of Multi-criteria Submodular Function Maximization
- Blog: Optimally Interpolating between Ex-Ante Fairness and Welfare
- Blog: Strategyproof and Approximately Maxmin Fair Share Allocation of Chores
- Blog: Fairness and Utilization in Allocating Resources with Uncertain Demand
Showing 60 of 149 papers.
History & citation
Current · Permanent link
- Randomized Mechanisms for Ex-Ante Fairness merged into this direction (78% overlap)
- Reconciling Probabilistic Fairness with Realized Outcomes merged into this direction (59% overlap)
- Randomized Distributions for Algorithmic Fairness merged into this direction (53% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_ex_ante_fairness_082d5939,
title = {ex-ante fairness},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/ex-ante-fairness/rdr_082d5939661141f1ad2ea9922e52d225},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_ex_ante_fairness_082d5939_v1,
title = {ex-ante fairness},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/ex-ante-fairness/rdr_082d5939661141f1ad2ea9922e52d225/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}