On the public citation graph
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items Under a Common Preference Graph
0 signed · 40 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/978-0-8176-4842-8_10openalex-extracted
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.1007/978-3-030-86838-3_20openalex-extracted
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG
inferredcites →https://doi.org/10.1007/978-3-030-87756-9_16openalex-extracted
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs
inferredcites →https://doi.org/10.1007/978-3-031-15714-1_30openalex-extracted
Online Max-min Fair Allocation
inferredcites →https://doi.org/10.1007/978-3-642-15775-2_47openalex-extracted
Algorithmic Meta-theorems for Restrictions of Treewidth
inferredcites →https://doi.org/10.1007/s003550050019openalex-extracted
Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
inferredcites →https://doi.org/10.1007/s00453-011-9554-xopenalex-extracted
Algorithmic Meta-theorems for Restrictions of Treewidth
inferredcites →https://doi.org/10.1007/s10458-013-9224-2openalex-extracted
Computational complexity and approximability of social welfare optimization in multiagent resource allocation
inferredcites →https://doi.org/10.1007/s10458-016-9340-xopenalex-extracted
Positional scoring-based allocation of indivisible goods
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-extracted
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/0969-6016(94)90010-8openalex-extracted
MACBETH — An Interactive Path Towards the Construction of Cardinal Value Functions
inferredcites →https://doi.org/10.1016/j.artint.2015.06.002openalex-extracted
Fair assignment of indivisible objects under ordinal preferences
inferredcites →https://doi.org/10.1016/j.dam.2004.02.017openalex-extracted
Linear-time modular decomposition of directed graphs
inferredcites →https://doi.org/10.1016/j.dam.2023.02.010openalex-extracted
Allocation of indivisible items with individual preference graphs
inferredcites →https://doi.org/10.1016/j.ejor.2004.05.031openalex-extracted
User acceptance of multi-criteria decision support systems: The impact of preference elicitation techniques
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/j.ejor.2021.06.020openalex-extracted
Fair allocation of indivisible goods with minimum inequality or minimum envy
inferredcites →https://doi.org/10.1016/j.mathsocsci.2009.05.002openalex-extracted
Maximizing the Minimum Voter Satisfaction on Spanning Trees
inferredcites →https://doi.org/10.1016/s0166-218x(97)00120-0openalex-extracted
The k-cardinality assignment problem
inferredcites →https://doi.org/10.1017/cbo9781107446984.012openalex-extracted
Introduction to the Theory of Fair Allocation
inferredcites →https://doi.org/10.1017/cbo9781139172387.008openalex-extracted
Interpersonal comparisons of utility: Why and how they are and should be made
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078334-6openalex-extracted
Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.1109/focs.2015.63openalex-extracted
FO Model Checking on Posets of Bounded Width
inferredcites →https://doi.org/10.1109/focs46700.2020.00062openalex-extracted
Twin-width I: Tractable FO Model Checking
inferredcites →https://doi.org/10.1109/tse.1979.234213openalex-extracted
On Path Cover Problems in Digraphs and Applications to Program Testing
inferredcites →https://doi.org/10.1137/0202019openalex-extracted
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1145/1120680.1120683openalex-extracted
Allocating indivisible goods
inferredcites →https://doi.org/10.1145/3301312openalex-extracted
Sparse Dynamic Programming on DAGs with Small Width
inferredcites →https://doi.org/10.1145/988772.988792openalex-extracted
On approximately fair allocations of indivisible goods
inferredcites →https://doi.org/10.1184/r1/6607142openalex-extracted
Max-min fair allocation of indivisible goods
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-extracted
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.1609/aaai.v34i09.7082openalex-extracted
Developments in Multi-Agent Fair Allocation
inferredcites →https://doi.org/10.1613/jair.2467openalex-extracted
Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
inferredcites →https://doi.org/10.2307/1969503openalex-extracted
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.24963/ijcai.2021/29openalex-extracted
Two-Sided Matching Meets Fair Division
inferredcites →https://doi.org/10.4159/9780674042605openalex-extracted
A theory of justice original edition
inferredcites →https://doi.org/10.4230/lipics.ipec.2021.6openalex-extracted
Twin-Width Is Linear in the Poset Width
inferredcites →https://doi.org/10.5555/1838206.1838290openalex-extracted
Complexity of social welfare optimization in multiagent resource allocation
inferredcites →https://doi.org/10.7155/jgaa.00207openalex-extracted
On the Maximum Independent Set Problem in Subclasses of Planar Graphs
inferredcites →https://doi.org/10.1184/r1/6605543openalex-snapshot
Fair Enough: Guaranteeing Approximate Maximin Shares
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.