On the public citation graph

On the Optimal Rearrangement of Multiple Matrices

https://doi.org/10.2139/ssrn.3512113
0 signed · 20 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-3-662-47904-9_8openalex-extracted
Fair Division of Indivisible Goods
inferredcites →https://doi.org/10.1007/s10458-015-9287-3openalex-extracted
Characterizing conflicts in fair division of indivisible goods using a scale of criteria
inferredcites →https://doi.org/10.1016/j.artint.2016.09.005openalex-extracted
Distributed fair allocation of indivisible goods
inferredcites →https://doi.org/10.1016/j.cor.2010.03.001openalex-extracted
A general branch-and-bound algorithm for fair division problems
inferredcites →https://doi.org/10.1016/j.ejor.2018.05.057openalex-extracted
Two-player fair division of indivisible items: Comparison of algorithms
inferredcites →https://doi.org/10.1016/s0169-7218(10)00021-3openalex-extracted
Fair Allocation Rules
inferredcites →https://doi.org/10.1017/cbo9780511598975openalex-extracted
Fair Division
inferredcites →https://doi.org/10.1017/cbo9781107446984.013openalex-extracted
Fair Allocation of Indivisible Goods
inferredcites →https://doi.org/10.1017/cbo9781107446984.014openalex-extracted
Cake Cutting Algorithms
inferredcites →https://doi.org/10.1145/1082473.1082747openalex-extracted
Allocation of indivisible goods
inferredcites →https://doi.org/10.1145/2940716.2940726openalex-extracted
The Unreasonable Fairness of Maximum Nash Welfare
inferredcites →https://doi.org/10.1145/3140756openalex-extracted
Fair Enough
inferredcites →https://doi.org/10.1145/3219166.3219238openalex-extracted
Fair Allocation of Indivisible Goods
inferredcites →https://doi.org/10.1145/3355902openalex-extracted
The Unreasonable Fairness of Maximum Nash Welfare
inferredcites →https://doi.org/10.1145/988772.988792openalex-extracted
On approximately fair allocations of indivisible goods
inferredcites →https://doi.org/10.1146/annurev-economics-080218-025559openalex-extracted
Fair Division in the Internet Age
inferredcites →https://doi.org/10.1201/9781439863855openalex-extracted
Cake-Cutting Algorithms
inferredcites →https://doi.org/10.4169/amer.math.monthly.120.01.035openalex-extracted
N -Person Cake-Cutting: There May Be No Perfect Division
inferredcites →https://doi.org/10.5555/2615731.2617458openalex-extracted
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.1016/j.cam.2021.113697openalex-snapshot
On some synchronization problems with multiple instances
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.