On the public citation graph

https://doi.org/10.2139/ssrn.4839490

0 signed · 31 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.1007/978-981-99-7184-8_7openalex-extracted
The Theory of Fair Allocation Under Structured Set Constraints
inferredcites →https://doi.org/10.1016/j.artint.2021.103578openalex-extracted
Picking sequences and monotonicity in weighted fair division
inferredcites →https://doi.org/10.1016/j.artint.2023.103965openalex-extracted
Fair division of indivisible goods: Recent progress and open questions
inferredcites →https://doi.org/10.1086/664613openalex-extracted
The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
inferredcites →https://doi.org/10.1137/1.9781611975031.165openalex-extracted
Almost Envy-Freeness with General Valuations
inferredcites →https://doi.org/10.1137/1.9781611977912.4openalex-extracted
Breaking the 3/4 Barrier for Approximate Maximin Share
inferredcites →https://doi.org/10.1145/2940716.2940726openalex-extracted
The Unreasonable Fairness of Maximum Nash Welfare
inferredcites →https://doi.org/10.1145/3355902openalex-extracted
The Unreasonable Fairness of Maximum Nash Welfare
inferredcites →https://doi.org/10.1145/3391403.3399526openalex-extracted
An Improved Approximation Algorithm for Maximin Shares
inferredcites →https://doi.org/10.1145/3434410openalex-extracted
The Fair Division of Hereditary Set Systems
inferredcites →https://doi.org/10.1145/3505156.3505162openalex-extracted
Constraints in fair division
inferredcites →https://doi.org/10.1145/3580507.3597698openalex-extracted
Guaranteeing Envy-Freeness under Generalized Assignment Constraints
inferredcites →https://doi.org/10.1146/annurev-economics-080218-025559openalex-extracted
Fair Division in the Internet Age
inferredcites →https://doi.org/10.1287/opre.2022.2432openalex-extracted
Best of Both Worlds: Ex Ante and Ex Post Fairness in Resource Allocation
inferredcites →https://doi.org/10.1609/aaai.v33i01.33019921openalex-extracted
Matroid Constrained Fair Allocation Problem
inferredcites →https://doi.org/10.1609/aaai.v35i6.16647openalex-extracted
Fair and Truthful Mechanisms for Dichotomous Valuations
inferredcites →https://doi.org/10.1609/aaai.v35i6.16650openalex-extracted
Achieving Proportionality up to the Maximin Item with Indivisible Goods
inferredcites →https://doi.org/10.1609/aaai.v35i6.16670openalex-extracted
On Fair Division under Heterogeneous Matroid Constraints
inferredcites →https://doi.org/10.1613/jair.1.13779openalex-extracted
On Fair Division under Heterogeneous Matroid Constraints
inferredcites →https://doi.org/10.24963/ijcai.2019/8openalex-extracted
Fair Allocation of Indivisible Goods and Chores
inferredcites →https://doi.org/10.24963/ijcai.2021/12openalex-extracted
Picking Sequences and Monotonicity in Weighted Fair Division
inferredcites →https://doi.org/10.24963/ijcai.2021/4openalex-extracted
PROPm Allocations of Indivisible Goods to Multiple Agents
inferredcites →https://doi.org/10.24963/ijcai.2021/65openalex-extracted
Budget-feasible Maximum Nash Social Welfare is Almost Envy-free
inferredcites →https://doi.org/10.48550/arxiv.1412.2226openalex-extracted
Possible and Necessary Allocations via Sequential Mechanisms
inferredcites →https://doi.org/10.48550/arxiv.1804.09521openalex-extracted
Fair Division Under Cardinality Constraints
inferredcites →https://doi.org/10.48550/arxiv.1903.00029openalex-extracted
An Improved Approximation Algorithm for Maximin Shares
inferredcites →https://doi.org/10.48550/arxiv.2106.07300openalex-extracted
Maximin Shares Under Cardinality Constraints
inferredcites →https://doi.org/10.48550/arxiv.2205.00236openalex-extracted
Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average
inferredcites →https://doi.org/10.48550/arxiv.2205.07779openalex-extracted
inferredcites →https://doi.org/10.65109/omut2311openalex-extracted
On regular and approximately fair allocations of indivisible goods

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-032-03639-1_11openalex-snapshot
Fairness Under Equal-Sized Bundles: Impossibility Results and Approximation Guarantees
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.