On the public citation graph

Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination

https://doi.org/10.1016/j.tcs.2020.07.006

0 signed · 93 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0022-0531(74)90075-1openalex-snapshot

Equity, envy, and efficiency

inferredcites →https://doi.org/10.1016/0047-2727(90)90003-zopenalex-snapshot

Uniform externalities

inferredcites →https://doi.org/10.1016/j.mathsocsci.2017.09.004openalex-snapshot

Approximate maximin shares for groups of agents

inferredcites →https://doi.org/10.1016/j.tcs.2021.02.020openalex-snapshot

Maximum Nash Welfare and Other Stories About EFX

inferredcites →https://doi.org/10.1017/cbo9780511598975openalex-snapshot

Fair Division

inferredcites →https://doi.org/10.1017/cbo9781107446984openalex-snapshot

Handbook of Computational Social Choice

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.9781611975031openalex-snapshot

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms

inferredcites →https://doi.org/10.1137/1.9781611975994.162openalex-snapshot

A Little Charity Guarantees Almost Envy-Freeness

inferredcites →https://doi.org/10.1145/2940716openalex-snapshot

Proceedings of the 2016 ACM Conference on Economics and Computation

inferredcites →https://doi.org/10.1145/2940716.2940726openalex-snapshot

The Unreasonable Fairness of Maximum Nash Welfare

inferredcites →https://doi.org/10.1145/3033274.3085136openalex-snapshot

Approximation Algorithms for Maximin Fair Division

inferredcites →https://doi.org/10.1145/3140756openalex-snapshot

Fair Enough

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/3328526openalex-snapshot

Proceedings of the 2019 ACM Conference on Economics and Computation

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/3355902openalex-snapshot

The Unreasonable Fairness of Maximum Nash Welfare

inferredcites →https://doi.org/10.1145/3391403openalex-snapshot

Proceedings of the 21st ACM Conference on Economics and Computation

inferredcites →https://doi.org/10.1145/3391403.3399511openalex-snapshot

EFX Exists for Three Agents

inferredcites →https://doi.org/10.1145/988772.988792openalex-snapshot

On approximately fair allocations of indivisible goods

inferredcites →https://doi.org/10.1609/aaai.v32i1.11463openalex-snapshot

Groupwise Maximin Fair Allocation of Indivisible Goods

inferredcites →https://doi.org/10.1613/jair.1.11618openalex-snapshot

Improving Nash Social Welfare Approximations

inferredcites →https://doi.org/10.2307/2589237openalex-snapshot

Fair Division: From Cake-Cutting to Dispute Resolution.

inferredcites →https://doi.org/10.2307/2589459openalex-snapshot

Cake-Cutting Algorithms: Be Fair if You Can.

inferredcites →https://doi.org/10.24963/ijcai.2018openalex-snapshot

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence

inferredcites →https://doi.org/10.24963/ijcai.2018/6openalex-snapshot

Comparing Approximate Relaxations of Envy-Freeness

inferredcites →https://doi.org/10.24963/ijcai.2019openalex-snapshot

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence

inferredcites →https://doi.org/10.24963/ijcai.2019/42openalex-snapshot

Improving Nash Social Welfare Approximations

inferredcites →https://doi.org/10.24963/ijcai.2020openalex-snapshot

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence

inferredcites →https://doi.org/10.4230/oasics.sosa.2019.20openalex-snapshot

Approximating Maximin Share Allocations

inferredcites →https://doi.org/10.48550/arxiv.1605.04026openalex-snapshot

On Truthful Mechanisms for Maximin Share Allocations

inferredcites →https://doi.org/10.48550/arxiv.1705.10706openalex-snapshot

Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness

inferredcites →https://doi.org/10.48550/arxiv.1903.00029openalex-snapshot

An Improved Approximation Algorithm for Maximin Shares

inferredcites →https://doi.org/10.48550/arxiv.1911.11005openalex-snapshot

Greedy Algorithms for Fair Division of Mixed Manna

inferredcites →https://doi.org/10.7551/mitpress/2954.001.0001openalex-snapshot

Fair Division and Collective Welfare

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-94676-0_29openalex-snapshot

Computing Envy-Freeable Allocations with Limited Subsidies

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-20350-3_26openalex-snapshot

Exact and Approximation Algorithms for PMMS Under Identical Constraints

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-032-03639-1_11openalex-snapshot

Fairness Under Equal-Sized Bundles: Impossibility Results and Approximation Guarantees

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-3-032-08560-3_16openalex-snapshot

Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods

inferred← citeshttps://doi.org/10.1007/978-981-95-4839-2_12openalex-snapshot

Approximating EFX Through a New Notion of Fairness

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/s00224-021-10039-8openalex-snapshot

The Price of Fairness for Indivisible Goods

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.1016/j.artint.2023.103965openalex-snapshot

Fair division of indivisible goods: Recent progress and open questions

inferred← citeshttps://doi.org/10.1016/j.artint.2023.104037openalex-snapshot

Approximately EFX allocations for indivisible chores

inferred← citeshttps://doi.org/10.1016/j.artint.2024.104118openalex-snapshot

Almost proportional allocations of indivisible chores: Computation, approximation and efficiency

inferred← citeshttps://doi.org/10.1016/j.artint.2025.104386openalex-snapshot

Weighted EF1 allocations for indivisible chores

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.ipl.2024.106519openalex-snapshot

Weighted fair division of indivisible items: A review

inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106577openalex-snapshot

Fair and truthful allocations under leveled valuations

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.020openalex-snapshot

Maximum Nash Welfare and Other Stories About EFX

inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114388openalex-snapshot

The existence and efficiency of PMMS allocations

inferred← citeshttps://doi.org/10.1016/j.tcs.2024.115010openalex-snapshot

EFX allocations for indivisible chores: Matching-based approach

inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115248openalex-snapshot

On the existence of EFX (and Pareto-optimal) allocations for binary chores

inferred← citeshttps://doi.org/10.1137/1.9781611975994.162openalex-snapshot

A Little Charity Guarantees Almost Envy-Freeness

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.3467605openalex-snapshot

Improving EFX Guarantees through Rainbow Cycle Number

inferred← citeshttps://doi.org/10.1145/3572885.3572887openalex-snapshot

Algorithmic fair allocation of indivisible items

inferred← citeshttps://doi.org/10.1145/3580507.3597764openalex-snapshot

Fair allocation in graphs

inferred← citeshttps://doi.org/10.1145/3580507.3597796openalex-snapshot

Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria

inferred← citeshttps://doi.org/10.1145/3670865.3673582openalex-snapshot

Pushing the Frontier on Approximate EFX Allocations

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.1145/3717823.3718305openalex-snapshot

Constant-Factor EFX Exists for Chores

inferred← citeshttps://doi.org/10.1145/3736252.3742509openalex-snapshot

EFX Exists for Three Types of Agents

inferred← citeshttps://doi.org/10.1145/3736252.3742562openalex-snapshot

Approximability Landscape of Welfare Maximization within Fair Allocations

inferred← citeshttps://doi.org/10.1145/3736252.3742613openalex-snapshot

Simultaneously Satisfying MXS and EFL

inferred← citeshttps://doi.org/10.1145/3774904.3792300openalex-snapshot

Allocating Chores with Restricted Additive Costs: Achieving EFX, MMS, and Efficiency Simultaneously

inferred← citeshttps://doi.org/10.1287/moor.2021.0252openalex-snapshot

Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number

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.1287/moor.2022.0058openalex-snapshot

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness

inferred← citeshttps://doi.org/10.1287/moor.2023.0244openalex-snapshot

Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria

inferred← citeshttps://doi.org/10.1287/moor.2025.0915openalex-snapshot

Envy-Freeness up to Any Good Allocations on Graphs

inferred← citeshttps://doi.org/10.1287/opre.2023.0433openalex-snapshot

EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number

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.1613/jair.1.13778openalex-snapshot

Fair in the Eyes of Others

inferred← citeshttps://doi.org/10.2139/ssrn.7512483openalex-snapshot

Pairwise Maximin Share Allocations Need Not Exist

inferred← citeshttps://doi.org/10.24963/ijcai.2022/110openalex-snapshot

Approximately EFX Allocations for Indivisible Chores

inferred← citeshttps://doi.org/10.24963/ijcai.2022/14openalex-snapshot

Fair Equilibria in Sponsored Search Auctions: The Advertisers’ Perspective

inferred← citeshttps://doi.org/10.24963/ijcai.2022/3openalex-snapshot

An EF2X Allocation Protocol for Restricted Additive Valuations

inferred← citeshttps://doi.org/10.24963/ijcai.2022/756openalex-snapshot

Fair Division of Indivisible Goods: A Survey

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.4230/lipics.approx/random.2021.1openalex-snapshot

On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources

inferred← citeshttps://doi.org/10.48550/arxiv.2101.09794openalex-snapshot

Equitable Division of a Path

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.