On the public citation graph

Technical perspective: An answer to fair division's most enigmatic question

https://doi.org/10.1145/3382131
0 signed · 32 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 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-85947-3_23openalex-snapshot
Computing Fair and Efficient Allocations with Few Utility Values
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-031-06678-8_2openalex-snapshot
On the Existence of EFX Allocations
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_10openalex-snapshot
Tractable Graph Structures in EFX Orientation
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-4207-6_32openalex-snapshot
Fair Division of Indivisible Chores with Weighted and Prioritized Agents
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/s13347-024-00779-zopenalex-snapshot
Rawlsian Algorithmic Fairness and a Missing Aggregation Property of the Difference Principle
inferred← citeshttps://doi.org/10.1007/s13347-026-01157-7openalex-snapshot
Algorithmic Fairness, Meritocracy, and Institutional Justice
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.artint.2023.103965openalex-snapshot
Fair division of indivisible goods: Recent progress and open questions
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113932openalex-snapshot
Computing fair and efficient allocations with few utility values
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.115010openalex-snapshot
EFX allocations for indivisible chores: Matching-based approach
inferred← citeshttps://doi.org/10.1137/1.9781611975994.162openalex-snapshot
A Little Charity Guarantees Almost Envy-Freeness
inferred← citeshttps://doi.org/10.1145/3465456.3467605openalex-snapshot
Improving EFX Guarantees through Rainbow Cycle Number
inferred← citeshttps://doi.org/10.1145/3564246.3585255openalex-snapshot
Approximating Nash Social Welfare by Matching and Local Search
inferred← citeshttps://doi.org/10.1145/3580507.3597698openalex-snapshot
Guaranteeing Envy-Freeness under Generalized Assignment Constraints
inferred← citeshttps://doi.org/10.1145/3580507.3597764openalex-snapshot
Fair allocation in graphs
inferred← citeshttps://doi.org/10.1145/3616009openalex-snapshot
EFX Exists for Three Agents
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/3736252.3742509openalex-snapshot
EFX Exists for Three Types of Agents
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.0257openalex-snapshot
Fair Shares: Feasibility, Domination, and Incentives
inferred← citeshttps://doi.org/10.1287/moor.2025.0915openalex-snapshot
Envy-Freeness up to Any Good Allocations on Graphs
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20410openalex-snapshot
Almost Full EFX Exists for Four Agents
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/806openalex-snapshot
Pushing the Limits of Fairness in Algorithmic Decision-Making
inferred← citeshttps://doi.org/10.32657/10356/152488openalex-snapshot
Fair resource allocation in rich domains
inferred← citeshttps://doi.org/10.48550/arxiv.2102.10654openalex-snapshot
(Almost Full) EFX Exists for Four Agents (and Beyond)
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.