On the public citation graph
Achieving a Fairer Future by Changing the Past
0 signed · 41 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/0176-2680(96)00003-1openalex-snapshot
Fair division: From cake-cutting to dispute resolution
inferredcites →https://doi.org/10.1017/cbo9781107446984openalex-snapshot
Handbook of Computational Social Choice
inferredcites →https://doi.org/10.1080/00029890.1999.12005142openalex-snapshot
Rental Harmony: Sperner's Lemma in Fair Division
inferredcites →https://doi.org/10.1137/15m1053682openalex-snapshot
Approximating the Nash Social Welfare with Indivisible Items
inferredcites →https://doi.org/10.1145/2764468.2764495openalex-snapshot
Dynamic Fair Division with Minimal Disruptions
inferredcites →https://doi.org/10.1145/2845926.2845931openalex-snapshot
Approximating the nash social welfare with indivisible items
inferredcites →https://doi.org/10.1145/2940716.2940724openalex-snapshot
Which Is the Fairest (Rent Division) of Them All?
inferredcites →https://doi.org/10.1145/2940716.2940726openalex-snapshot
The Unreasonable Fairness of Maximum Nash Welfare
inferredcites →https://doi.org/10.1145/3033274.3085123openalex-snapshot
Controlled Dynamic Fair Division
inferredcites →https://doi.org/10.1145/3033274.3085136openalex-snapshot
Approximation Algorithms for Maximin Fair Division
inferredcites →https://doi.org/10.1145/3131361openalex-snapshot
Which Is the Fairest (Rent Division) of Them All?
inferredcites →https://doi.org/10.1145/3219166.3219176openalex-snapshot
Finding Fair and Efficient Allocations
inferredcites →https://doi.org/10.1145/3219166.3219179openalex-snapshot
How to Make Envy Vanish Over Time
inferredcites →https://doi.org/10.1145/988772.988792openalex-snapshot
On approximately fair allocations of indivisible goods
inferredcites →https://doi.org/10.1613/jair.4405openalex-snapshot
No Agent Left Behind: Dynamic Fair Division of Multiple Resources
inferredcites →https://doi.org/10.2139/ssrn.2826474openalex-snapshot
Dividing Goods or Bads Under Additive Utilities
inferredcites →https://doi.org/10.2139/ssrn.2860002openalex-snapshot
Dividing Goods and Bads Under Additive Utilities
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.2017/7openalex-snapshot
Pure Nash Equilibria in Online Fair Division
inferredcites →https://doi.org/10.48550/arxiv.1502.07571openalex-snapshot
Online Fair Division: analysing a Food Bank problem
inferredcites →https://doi.org/10.48550/arxiv.1605.04026openalex-snapshot
On Truthful Mechanisms for Maximin Share Allocations
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.4739232openalex-extracted
Online Fair Allocation of Perishable Resources
inferred← citeshttps://doi.org/10.1007/978-3-032-03639-1_12openalex-snapshot
Online Fair Division for Personalized 2-Value Instances
inferred← citeshttps://doi.org/10.1287/opre.2022.2397openalex-snapshot
Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Trade-off Curve
inferred← citeshttps://doi.org/10.1609/aaai.v34i09.7081openalex-snapshot
Online Fair Division: A Survey
inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16685openalex-snapshot
Fair and Efficient Online Allocations with Normalized Valuations
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20416openalex-snapshot
On Improving Resource Allocations by Sharing
inferred← citeshttps://doi.org/10.1609/aaai.v38i9.28858openalex-snapshot
Greedy-Based Online Fair Allocation with Adversarial Input: Enabling Best-of-Many-Worlds Guarantees
inferred← citeshttps://doi.org/10.1613/jair.1.15001openalex-snapshot
Improving Resource Allocations by Sharing in Pairs
inferred← citeshttps://doi.org/10.24963/ijcai.2022/756openalex-snapshot
Fair Division of Indivisible Goods: A Survey
inferred← citeshttps://doi.org/10.3233/faia230396openalex-snapshot
The Leximin Approach for a Sequence of Collective Decisions
inferred← citeshttps://doi.org/10.48550/arxiv.1907.11672openalex-snapshot
Fairness-Efficiency Tradeoffs in Dynamic Fair Division
inferred← citeshttps://doi.org/10.48550/arxiv.2011.14382openalex-snapshot
Sequential Fair Allocation of Limited Resources under Stochastic Demands
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.