On the public citation graph
EFX Exists for Three Agents
0 signed · 99 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/s10458-015-9287-3openalex-snapshot
Characterizing conflicts in fair division of indivisible goods using a scale of criteria
inferredcites →https://doi.org/10.1016/j.ipl.2017.01.012openalex-snapshot
APX-hardness of maximizing Nash social welfare with indivisible items
inferredcites →https://doi.org/10.1086/664613openalex-snapshot
The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
inferredcites →https://doi.org/10.1137/1.9781611975031.147openalex-snapshot
Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities
inferredcites →https://doi.org/10.1137/1.9781611975031.150openalex-snapshot
Approximating the Nash Social Welfare with Budget-Additive Valuations
inferredcites →https://doi.org/10.1137/1.9781611975031.165openalex-snapshot
Almost Envy-Freeness with General Valuations
inferredcites →https://doi.org/10.1137/1.9781611975994.162openalex-snapshot
A Little Charity Guarantees Almost Envy-Freeness
inferredcites →https://doi.org/10.1137/1.9781611975994.163openalex-snapshot
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
inferredcites →https://doi.org/10.1137/15m1053682openalex-snapshot
Approximating the Nash Social Welfare with Indivisible Items
inferredcites →https://doi.org/10.1145/2940716.2940726openalex-snapshot
The Unreasonable Fairness of Maximum Nash Welfare
inferredcites →https://doi.org/10.1145/3033274.3085109openalex-snapshot
Convex Program Duality, Fisher Markets, and Nash Social Welfare
inferredcites →https://doi.org/10.1145/3033274.3085136openalex-snapshot
Approximation Algorithms for Maximin Fair Division
inferredcites →https://doi.org/10.1145/3147173openalex-snapshot
Approximation Algorithms for Computing Maximin Share Allocations
inferredcites →https://doi.org/10.1145/3219166.3219176openalex-snapshot
Finding Fair and Efficient Allocations
inferredcites →https://doi.org/10.1145/3219166.3219238openalex-snapshot
Fair Allocation of Indivisible Goods
inferredcites →https://doi.org/10.1145/3274641openalex-snapshot
Leximin Allocations in the Real World
inferredcites →https://doi.org/10.1145/3328526.3329574openalex-snapshot
Envy-Freeness Up to Any Item with High Nash Welfare
inferredcites →https://doi.org/10.1145/988772.988792openalex-snapshot
On approximately fair allocations of indivisible goods
inferredcites →https://doi.org/10.1287/opre.2016.1544openalex-snapshot
Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation
inferredcites →https://doi.org/10.24963/ijcai.2019/42openalex-snapshot
Improving Nash Social Welfare Approximations
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2018.25openalex-snapshot
On Fair Division for Indivisible Items
inferredcites →https://doi.org/10.4230/lipics.itcs.2017.36openalex-snapshot
Nash Social Welfare, Matrix Permanent, and Stable Polynomials
inferredcites →https://doi.org/10.4230/oasics.sosa.2019.20openalex-snapshot
Approximating Maximin Share Allocations
inferredcites →https://doi.org/10.48550/arxiv.1903.00029openalex-snapshot
An Improved Approximation Algorithm for Maximin Shares
inferredcites →https://doi.org/10.48550/arxiv.2002.05119openalex-snapshot
EFX Exists for Three Agents
inferredcites →https://doi.org/10.5555/2615731.2617458openalex-snapshot
Characterizing conflicts in fair division of indivisible goods using a scale of criteria
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4756346openalex-extracted
Efx Allocations for Indivisible Chores: Matching-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-030-64946-3_1openalex-snapshot
Almost Envy-Free Repeated Matching in Two-Sided Markets
inferred← citeshttps://doi.org/10.1007/978-3-030-64946-3_25openalex-snapshot
Optimal Bounds on the Price of Fairness for Indivisible Goods
inferred← citeshttps://doi.org/10.1007/978-3-030-85947-3_23openalex-snapshot
Computing Fair and Efficient Allocations with Few Utility Values
inferred← citeshttps://doi.org/10.1007/978-3-030-87756-9_19openalex-snapshot
Minimizing and Balancing Envy Among Agents Using Ordered Weighted Average
inferred← citeshttps://doi.org/10.1007/978-3-030-94676-0_9openalex-snapshot
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
inferred← citeshttps://doi.org/10.1007/978-3-031-06678-8_2openalex-snapshot
On the Existence of EFX Allocations
inferred← citeshttps://doi.org/10.1007/978-3-031-20350-3_26openalex-snapshot
Exact and Approximation Algorithms for PMMS Under Identical Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-20796-9_1openalex-snapshot
EFX Under Budget Constraint
inferred← citeshttps://doi.org/10.1007/978-3-031-20862-1_1openalex-snapshot
Fair Allocation with Special Externalities
inferred← citeshttps://doi.org/10.1007/978-3-031-39344-0_19openalex-snapshot
EFX Allocations Exist for Binary Valuations
inferred← citeshttps://doi.org/10.1007/978-3-031-43254-5_15openalex-snapshot
EFX Allocations for Indivisible Chores: Matching-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-43254-5_17openalex-snapshot
The Frontier of Intractability for EFX with Two Agents
inferred← citeshttps://doi.org/10.1007/978-3-031-48974-7_33openalex-snapshot
One Quarter Each (on Average) Ensures Proportionality
inferred← citeshttps://doi.org/10.1007/978-3-031-49614-1_21openalex-snapshot
EFX Allocation to Chores over Small Graph
inferred← citeshttps://doi.org/10.1007/978-3-031-73903-3_17openalex-snapshot
Envy-Free and Efficient Allocations for Graphical Valuations
inferred← citeshttps://doi.org/10.1007/978-3-032-08560-3_10openalex-snapshot
The Fairness of Maximum Nash Social Welfare Under Matroid Constraints and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-032-08560-3_15openalex-snapshot
Almost Envy-Free Allocation of Indivisible Goods: A Tale of Two Valuations
inferred← citeshttps://doi.org/10.1007/978-981-96-4445-2_28openalex-snapshot
The Price of Fairness for Budget-Feasible EF1 Allocations
inferred← citeshttps://doi.org/10.1007/978-981-97-7752-5_12openalex-snapshot
Finding Fair and Efficient Allocations Under Budget Constraints
inferred← citeshttps://doi.org/10.1007/978-981-97-7752-5_3openalex-snapshot
On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores
inferred← citeshttps://doi.org/10.1007/978-981-99-9772-5_9openalex-snapshot
Algorithms for Future Mobility Society
inferred← citeshttps://doi.org/10.1007/s00224-021-10039-8openalex-snapshot
The Price of Fairness for Indivisible Goods
inferred← citeshttps://doi.org/10.1007/s00453-025-01294-zopenalex-snapshot
Reforming an Envy-Free Matching
inferred← citeshttps://doi.org/10.1007/s10458-021-09532-8openalex-snapshot
Fair allocation of indivisible goods and chores
inferred← citeshttps://doi.org/10.1007/s10458-023-09618-5openalex-snapshot
Fairness criteria for allocating indivisible chores: connections and efficiencies
inferred← citeshttps://doi.org/10.1007/s10458-026-09754-8openalex-snapshot
$$\textsf {EFX}$$ allocations and orientations on bipartite multi-graphs: a complete picture
inferred← citeshttps://doi.org/10.1007/s10878-025-01275-6openalex-snapshot
Guaranteeing fairness and efficiency under budget constraints
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103436openalex-snapshot
Fair division of mixed divisible and indivisible goods
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.039openalex-snapshot
On the number of almost envy-free allocations
inferred← citeshttps://doi.org/10.1016/j.dam.2023.06.035openalex-snapshot
Existence of EFX for two additive valuations
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.006openalex-snapshot
Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination
inferred← citeshttps://doi.org/10.1109/tnse.2023.3332104openalex-snapshot
Maximum Nash Social Welfare Under Budget-Feasible EFX
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch13openalex-snapshot
Fair allocation of a multiset of indivisible items
inferred← citeshttps://doi.org/10.1137/20m1353381openalex-snapshot
Closing Gaps in Asymptotic Fair Division
inferred← citeshttps://doi.org/10.1142/s0129054122460066openalex-snapshot
Restricted Existence and Approximation Algorithms for PMMS
inferred← citeshttps://doi.org/10.1145/3465456.3467555openalex-snapshot
An Algorithmic Framework for Approximating Maximin Share Allocation of Chores
inferred← citeshttps://doi.org/10.1145/3465456.3467605openalex-snapshot
Improving EFX Guarantees through Rainbow Cycle Number
inferred← citeshttps://doi.org/10.1145/3485447.3512057openalex-snapshot
Almost (Weighted) Proportional Allocations for Indivisible Chores✱✱
inferred← citeshttps://doi.org/10.1145/3486622.3493955openalex-snapshot
Mechanism Design without Money for Fair Allocations
inferred← citeshttps://doi.org/10.1145/3490486.3538285openalex-snapshot
Fair Allocations for Smoothed Utilities
inferred← citeshttps://doi.org/10.1145/3564246.3585255openalex-snapshot
Approximating Nash Social Welfare by Matching and Local Search
inferred← citeshttps://doi.org/10.1145/3572885.3572887openalex-snapshot
Algorithmic fair allocation of indivisible items
inferred← citeshttps://doi.org/10.1145/3580507.3597783openalex-snapshot
On picking sequences for chores
inferred← citeshttps://doi.org/10.1145/3618116openalex-snapshot
Unified Fair Allocation of Goods and Chores via Copies
inferred← citeshttps://doi.org/10.1145/3670865.3673592openalex-snapshot
Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations
inferred← citeshttps://doi.org/10.1287/moor.2022.0044openalex-snapshot
Extension of Additive Valuations to General Valuations on the Existence of EFX
inferred← citeshttps://doi.org/10.1360/ssi-2021-0449openalex-snapshot
Almost envy-free allocations of unweighted items
inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16650openalex-snapshot
Achieving Proportionality up to the Maximin Item with Indivisible Goods
inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16675openalex-snapshot
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings
inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16689openalex-snapshot
Fair and Efficient Allocations under Lexicographic Preferences
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20441openalex-snapshot
Reforming an Envy-Free Matching
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25680openalex-snapshot
Fairness Concepts for Indivisible Items with Externalities
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25688openalex-snapshot
Fair Division with Prioritized Agents
inferred← citeshttps://doi.org/10.24963/ijcai.2021/32openalex-snapshot
Fair and Efficient Resource Allocation with Partial Information
inferred← citeshttps://doi.org/10.24963/ijcai.2021/4openalex-snapshot
PROPm Allocations of Indivisible Goods to Multiple Agents
inferred← citeshttps://doi.org/10.24963/ijcai.2022/108openalex-snapshot
Cluster Attack: Query-based Adversarial Attacks on Graph with Graph-Dependent Priors
inferred← citeshttps://doi.org/10.24963/ijcai.2023/277openalex-snapshot
Fair and Efficient Allocation of Indivisible Chores with Surplus
inferred← citeshttps://doi.org/10.24963/ijcai.2023/284openalex-snapshot
New Fairness Concepts for Allocating Indivisible Items
inferred← citeshttps://doi.org/10.24963/ijcai.2023/286openalex-snapshot
Rainbow Cycle Number and EFX Allocations: (Almost) Closing the Gap
inferred← citeshttps://doi.org/10.24963/ijcai.2023/302openalex-snapshot
New Algorithms for the Fair and Efficient Allocation of Indivisible Chores
inferred← citeshttps://doi.org/10.24963/ijcai.2023/305openalex-snapshot
Fairly Allocating Goods and (Terrible) Chores
inferred← citeshttps://doi.org/10.24963/ijcai.2023/806openalex-snapshot
Pushing the Limits of Fairness in Algorithmic Decision-Making
inferred← citeshttps://doi.org/10.3233/faia230346openalex-snapshot
EFx Budget-Feasible Allocations with High Nash Welfare
inferred← citeshttps://doi.org/10.32657/10356/152488openalex-snapshot
Fair resource allocation in rich domains
inferred← citeshttps://doi.org/10.48550/arxiv.2006.04428openalex-snapshot
Envy-free Relaxations for Goods, Chores, and Mixed Items
inferred← citeshttps://doi.org/10.48550/arxiv.2102.10654openalex-snapshot
(Almost Full) EFX Exists for Four Agents (and Beyond)
inferred← citeshttps://doi.org/10.70675/ce4a00c6ze3cdz40f1zb73cz1e67f8069898openalex-snapshot
Procedures based on Exchanges and new Relaxations of Envy-Freeness in Fair Division of Indivisible Goods
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.