On the public citation graph

Fair Enough

0 signed · 159 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/3-540-36494-3_52openalex-snapshot

Cake-Cutting Is Not a Piece of Cake

inferredcites →https://doi.org/10.1007/978-3-642-25510-6_24openalex-snapshot

On Worst-Case Allocations in the Presence of Indivisible Goods

inferredcites →https://doi.org/10.1007/978-3-662-47672-7_4openalex-snapshot

Approximation Algorithms for Computing Maximin Share Allocations

inferredcites →https://doi.org/10.1016/0001-8708(87)90055-7openalex-snapshot

Splitting necklaces

inferredcites →https://doi.org/10.1016/0047-2727(90)90003-zopenalex-snapshot

Uniform externalities

inferredcites →https://doi.org/10.1016/j.disopt.2006.07.003openalex-snapshot

On the complexity of cake cutting

inferredcites →https://doi.org/10.1016/s0167-6377(96)00055-7openalex-snapshot

A polynomial-time approximation scheme for maximizing the minimum machine completion time

inferredcites →https://doi.org/10.1017/cbo9780511598975openalex-snapshot

Fair Division

inferredcites →https://doi.org/10.1023/b:theo.0000024421.85722.0aopenalex-snapshot

FAIR DIVISION OF INDIVISIBLE ITEMS

inferredcites →https://doi.org/10.1080/00029890.1995.11990526openalex-snapshot

An Envy-Free Cake Division Protocol

inferredcites →https://doi.org/10.1086/664613openalex-snapshot

The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes

inferredcites →https://doi.org/10.1090/noti1075openalex-snapshot

Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm

inferredcites →https://doi.org/10.1109/focs.2006.17openalex-snapshot

Balanced Allocations of Cake

inferredcites →https://doi.org/10.1137/1.9780898716474openalex-snapshot

Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

inferredcites →https://doi.org/10.1145/1120680.1120683openalex-snapshot

Allocating indivisible goods

inferredcites →https://doi.org/10.1145/1132516.1132522openalex-snapshot

The Santa Claus problem

inferredcites →https://doi.org/10.1145/1250790.1250808openalex-snapshot

An approximation algorithm for max-min fair allocation of indivisible goods

inferredcites →https://doi.org/10.1145/2229012.2229075openalex-snapshot

Beyond dominant resource fairness

inferredcites →https://doi.org/10.1145/2483852.2483870openalex-snapshot

Cake cutting

inferredcites →https://doi.org/10.1145/2600057.2602835openalex-snapshot

Fair enough

inferredcites →https://doi.org/10.1145/2728732.2728738openalex-snapshot

Spliddit

inferredcites →https://doi.org/10.1145/2739040openalex-snapshot

Beyond Dominant Resource Fairness

inferredcites →https://doi.org/10.1145/2940716.2940726openalex-snapshot

The Unreasonable Fairness of Maximum Nash Welfare

inferredcites →https://doi.org/10.1145/3033274.3085136openalex-snapshot

Approximation Algorithms for Maximin Fair Division

inferredcites →https://doi.org/10.1145/3219166.3219238openalex-snapshot

Fair Allocation of Indivisible Goods

inferredcites →https://doi.org/10.1145/75246.75248openalex-snapshot

Analysis and simulation of a fair queueing algorithm

inferredcites →https://doi.org/10.1145/75247.75248openalex-snapshot

Analysis and simulation of a fair queueing algorithm

inferredcites →https://doi.org/10.1145/988772.988792openalex-snapshot

On approximately fair allocations of indivisible goods

inferredcites →https://doi.org/10.1214/aop/1176992173openalex-snapshot

Partitioning General Probability Measures

inferredcites →https://doi.org/10.1609/aaai.v30i1.10041openalex-snapshot

When Can the Maximin Share Guarantee Be Guaranteed?

inferredcites →https://doi.org/10.1613/jair.4405openalex-snapshot

No Agent Left Behind: Dynamic Fair Division of Multiple Resources

inferredcites →https://doi.org/10.2307/1883182openalex-snapshot

Egalitarian Equivalent Allocations: A New Concept of Economic Equity

inferredcites →https://doi.org/10.2307/2589237openalex-snapshot

Fair Division: From Cake-Cutting to Dispute Resolution.

inferredcites →https://doi.org/10.4230/lipics.stacs.2012.iopenalex-snapshot

Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents

inferredcites →https://doi.org/10.48550/arxiv.1605.04026openalex-snapshot

On Truthful Mechanisms for Maximin Share Allocations

inferredcites →https://doi.org/10.48550/arxiv.1704.00222openalex-snapshot

Fair Allocation of Indivisible Goods: Improvement and Generalization

inferredcites →https://doi.org/10.5555/1972457.1972490openalex-snapshot

Dominant resource fairness: fair allocation of multiple resource types

inferredcites →https://doi.org/10.5555/2615731.2617458openalex-snapshot

Characterizing conflicts in fair division of indivisible goods using a scale of criteria

inferredcites →https://doi.org/10.5555/2750423.2750439openalex-snapshot

No agent left behind

inferredcites →https://doi.org/10.7551/mitpress/2954.001.0001openalex-snapshot

Fair Division and Collective Welfare

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.3126935openalex-extracted

3 Persons, 2 Cuts: A Maximin Envy-Free and a Maximally Equitable Cake-Cutting Algorithm

inferred← citeshttps://doi.org/10.2139/ssrn.3512113openalex-extracted

On the Optimal Rearrangement of Multiple Matrices

inferred← citeshttps://doi.org/10.1002/cpe.70091openalex-snapshot

An Alternative Mechanism for Multiresource Fair Allocation in Heterogeneous Cloud Computing Systems

inferred← citeshttps://doi.org/10.1007/978-3-030-04612-5_20openalex-snapshot

The Fair Division of Hereditary Set Systems

inferred← citeshttps://doi.org/10.1007/978-3-030-12051-1_12-1openalex-snapshot

The Notion of Fair Division in Negotiations

inferred← citeshttps://doi.org/10.1007/978-3-030-49629-6_12openalex-snapshot

The Notion of Fair Division in Negotiations

inferred← citeshttps://doi.org/10.1007/978-3-030-85947-3_25openalex-snapshot

Two Birds with One Stone: Fairness and Welfare via Transfers

inferred← citeshttps://doi.org/10.1007/978-3-030-94676-0_20openalex-snapshot

A Tight Negative Example for MMS Fair Allocations

inferred← citeshttps://doi.org/10.1007/978-3-030-94676-0_9openalex-snapshot

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness

inferred← citeshttps://doi.org/10.1007/978-3-031-20614-6_11openalex-snapshot

Maximin Shares Under Cardinality Constraints

inferred← citeshttps://doi.org/10.1007/978-3-031-20862-1_1openalex-snapshot

Fair Allocation with Special Externalities

inferred← citeshttps://doi.org/10.1007/978-3-031-20865-2_29openalex-snapshot

EEF1-NN: Efficient and EF1 Allocations Through Neural Networks

inferred← citeshttps://doi.org/10.1007/978-3-031-22832-2_14openalex-snapshot

On Best-of-Both-Worlds Fair-Share Allocations

inferred← citeshttps://doi.org/10.1007/978-3-031-43254-5_13openalex-snapshot

Maximin Fair Allocation of Indivisible Items Under Cost Utilities

inferred← citeshttps://doi.org/10.1007/978-3-031-48974-7_12openalex-snapshot

The Good, the Bad and the Submodular: Fairly Allocating Mixed Manna Under Order-Neutral Submodular Preferences

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-19-8152-4_19openalex-snapshot

Maximin Share Based Mechanisms for Multi-resource Fair Allocation with Divisible and Indivisible Tasks

inferred← citeshttps://doi.org/10.1007/978-981-95-0215-8_22openalex-snapshot

Fair and Efficient Graphical Resource Allocation with Matching-Induced Utilities

inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_30openalex-snapshot

Maximin Share Allocation Under Knapsack Constraints

inferred← citeshttps://doi.org/10.1007/978-981-96-8312-3_25openalex-snapshot

Improved Approximation of Maximin Share Fair Allocation Under Generalized Assignment Constraints

inferred← citeshttps://doi.org/10.1007/s00224-021-10039-8openalex-snapshot

The Price of Fairness for Indivisible Goods

inferred← citeshttps://doi.org/10.1007/s00453-022-01079-8openalex-snapshot

Fair Allocation of Indivisible Items with Conflict Graphs

inferred← citeshttps://doi.org/10.1007/s10107-022-01855-yopenalex-snapshot

Approximate and strategyproof maximin share allocation of chores with ordinal preferences

inferred← citeshttps://doi.org/10.1007/s10458-021-09517-7openalex-snapshot

Maximin fairness with mixed divisible and indivisible goods

inferred← citeshttps://doi.org/10.1007/s10458-021-09532-8openalex-snapshot

Fair allocation of indivisible goods and chores

inferred← citeshttps://doi.org/10.1007/s10458-023-09618-5openalex-snapshot

Fairness criteria for allocating indivisible chores: connections and efficiencies

inferred← citeshttps://doi.org/10.1007/s10458-024-09686-1openalex-snapshot

Budget-feasible egalitarian allocation of conflicting jobs

inferred← citeshttps://doi.org/10.1007/s10458-026-09731-1openalex-snapshot

Maximin shares under cardinality constraints

inferred← citeshttps://doi.org/10.1007/s10479-026-07185-yopenalex-snapshot

Maximin share fair division of a k-uniform hypergraph

inferred← citeshttps://doi.org/10.1007/s10878-025-01331-1openalex-snapshot

Approximate maximin share allocation for indivisible goods under a knapsack constraint

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.2021.103547openalex-snapshot

An improved approximation algorithm for maximin shares

inferred← citeshttps://doi.org/10.1016/j.artint.2021.103578openalex-snapshot

Picking sequences and monotonicity in weighted fair division

inferred← citeshttps://doi.org/10.1016/j.artint.2021.103633openalex-snapshot

Fair allocation of indivisible goods: Beyond additive valuations

inferred← citeshttps://doi.org/10.1016/j.artint.2022.103820openalex-snapshot

Fair and efficient allocation with few agent types, few item types, or small value levels

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.artint.2023.104049openalex-snapshot

Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem

inferred← citeshttps://doi.org/10.1016/j.artint.2024.104118openalex-snapshot

Almost proportional allocations of indivisible chores: Computation, approximation and efficiency

inferred← citeshttps://doi.org/10.1016/j.artint.2024.104177openalex-snapshot

Class fairness in online matching

inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102006openalex-snapshot

Keep your distance: Land division with separation

inferred← citeshttps://doi.org/10.1016/j.dam.2023.06.035openalex-snapshot

Existence of EFX for two additive valuations

inferred← citeshttps://doi.org/10.1016/j.ejor.2021.06.020openalex-snapshot

Fair allocation of indivisible goods with minimum inequality or minimum envy

inferred← citeshttps://doi.org/10.1016/j.geb.2021.11.006openalex-snapshot

Almost envy-free allocations with connected bundles

inferred← citeshttps://doi.org/10.1016/j.geb.2025.03.004openalex-snapshot

Fair division with subjective divisibility

inferred← citeshttps://doi.org/10.1016/j.ic.2025.105371openalex-snapshot

On the price of fairness of allocating contiguous blocks

inferred← citeshttps://doi.org/10.1016/j.ins.2021.11.059openalex-snapshot

Envy-free matchings in bipartite graphs and their applications to fair division

inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106577openalex-snapshot

Fair and truthful allocations under leveled valuations

inferred← citeshttps://doi.org/10.1016/j.socnet.2020.01.002openalex-snapshot

A systemic approach to sociometric group research: Advancing the work of Leslie Day Zeleny, 1939-1947

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.006openalex-snapshot

Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.020openalex-snapshot

Maximum Nash Welfare and Other Stories About EFX

inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115322openalex-snapshot

Worst-case fair guarantees when spending a common budget

inferred← citeshttps://doi.org/10.1038/s41598-025-22657-0openalex-snapshot

Fair-efficient allocation mechanism with meta-types resources in cloud computing

inferred← citeshttps://doi.org/10.1080/0025570x.2022.2023300openalex-snapshot

Three Persons, Two Cuts: A New Cake-Cutting Algorithm

inferred← citeshttps://doi.org/10.1109/cscwd64889.2025.11033316openalex-snapshot

Fair Assignment for Agents with Multiple Weights

inferred← citeshttps://doi.org/10.1109/icra55743.2025.11128316openalex-snapshot

Heuristically Guided Compilation for Task Assignment and Path Finding

inferred← citeshttps://doi.org/10.1109/ojcoms.2022.3169969openalex-snapshot

MAGIKS: Fair Multi-Resource Allocation Game Induced by Kalai-Smorodinsky Bargaining Solution

inferred← citeshttps://doi.org/10.1109/tnet.2022.3213426openalex-snapshot

Fair Multi-Resource Allocation in Heterogeneous Servers With an External Resource Type

inferred← citeshttps://doi.org/10.1137/1.9781611975994.162openalex-snapshot

A Little Charity Guarantees Almost Envy-Freeness

inferred← citeshttps://doi.org/10.1137/20m1313349openalex-snapshot

Fairly Allocating Many Goods with Few Queries

inferred← citeshttps://doi.org/10.1137/20m1388310openalex-snapshot

The Price of Connectivity in Fair Division

inferred← citeshttps://doi.org/10.1142/s0129054122460066openalex-snapshot

Restricted Existence and Approximation Algorithms for PMMS

inferred← citeshttps://doi.org/10.1145/3033274.3085136openalex-snapshot

Approximation Algorithms for Maximin Fair Division

inferred← citeshttps://doi.org/10.1145/3219166.3219176openalex-snapshot

Finding Fair and Efficient Allocations

inferred← citeshttps://doi.org/10.1145/3219166.3219238openalex-snapshot

Fair Allocation of Indivisible Goods

inferred← citeshttps://doi.org/10.1145/3328526.3329574openalex-snapshot

Envy-Freeness Up to Any Item with High Nash Welfare

inferred← citeshttps://doi.org/10.1145/3381525openalex-snapshot

Approximation Algorithms for Maximin Fair Division

inferred← citeshttps://doi.org/10.1145/3391403.3399447openalex-snapshot

One Dollar Each Eliminates Envy

inferred← citeshttps://doi.org/10.1145/3391403.3399511openalex-snapshot

EFX Exists for Three Agents

inferred← citeshttps://doi.org/10.1145/3391403.3399526openalex-snapshot

An Improved Approximation Algorithm for Maximin Shares

inferred← citeshttps://doi.org/10.1145/3434410openalex-snapshot

The Fair Division of Hereditary Set Systems

inferred← citeshttps://doi.org/10.1145/3457166openalex-snapshot

Weighted Envy-Freeness in Indivisible Item Allocation

inferred← citeshttps://doi.org/10.1145/3465456.3467553openalex-snapshot

Indivisible Mixed Manna: On the Computability of MMS+PO Allocations

inferred← citeshttps://doi.org/10.1145/3465456.3467555openalex-snapshot

An Algorithmic Framework for Approximating Maximin Share Allocation of Chores

inferred← citeshttps://doi.org/10.1145/3465456.3467605openalex-snapshot

Improving EFX Guarantees through Rainbow Cycle Number

inferred← citeshttps://doi.org/10.1145/3485447.3512057openalex-snapshot

Almost (Weighted) Proportional Allocations for Indivisible Chores✱✱

inferred← citeshttps://doi.org/10.1145/3572885.3572887openalex-snapshot

Algorithmic fair allocation of indivisible items

inferred← citeshttps://doi.org/10.1145/3580507.3597783openalex-snapshot

On picking sequences for chores

inferred← citeshttps://doi.org/10.1145/3616009openalex-snapshot

EFX Exists for Three Agents

inferred← citeshttps://doi.org/10.1145/3618116openalex-snapshot

Unified Fair Allocation of Goods and Chores via Copies

inferred← citeshttps://doi.org/10.1145/3703845openalex-snapshot

On Hill’s Worst-Case Guarantee for Indivisible Bads

inferred← citeshttps://doi.org/10.1145/3717823.3718119openalex-snapshot

Share-Based Fairness for Arbitrary Entitlements

inferred← citeshttps://doi.org/10.1145/3736252.3742553openalex-snapshot

Low communication protocols for fair allocation of indivisible goods

inferred← citeshttps://doi.org/10.1145/3736252.3742613openalex-snapshot

Simultaneously Satisfying MXS and EFL

inferred← citeshttps://doi.org/10.1145/3736252.3742621openalex-snapshot

Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem

inferred← citeshttps://doi.org/10.1145/3770855.3817920openalex-snapshot

Parameterized Fair Resource Allocation under Diversity Constraints

inferred← citeshttps://doi.org/10.1145/3774904.3792305openalex-snapshot

All-but-one MMS Allocation for Chores

inferred← citeshttps://doi.org/10.1145/3774904.3792590openalex-snapshot

Efficient and Fair Allocation on Graphs: From Orientation to Position-Aware Valuations

inferred← citeshttps://doi.org/10.1287/moor.2020.1062openalex-snapshot

Competitive Equilibrium with Indivisible Goods and Generic Budgets

inferred← citeshttps://doi.org/10.1287/moor.2020.1096openalex-snapshot

Fair Allocation of Indivisible Goods: Improvement

inferred← citeshttps://doi.org/10.1287/moor.2021.0199openalex-snapshot

Fair-Share Allocations for Agents with Arbitrary Entitlements

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.0044openalex-snapshot

Extension of Additive Valuations to General Valuations on the Existence of EFX

inferred← citeshttps://doi.org/10.1287/moor.2022.0058openalex-snapshot

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness

inferred← citeshttps://doi.org/10.1287/moor.2022.0257openalex-snapshot

Fair Shares: Feasibility, Domination, and Incentives

inferred← citeshttps://doi.org/10.1287/moor.2023.0203openalex-snapshot

On Interim Envy-Free Allocation Lotteries

inferred← citeshttps://doi.org/10.1287/opre.2022.2279openalex-snapshot

Efficient Fair Division with Minimal Sharing

inferred← citeshttps://doi.org/10.1287/opre.2022.2432openalex-snapshot

Best of Both Worlds: Ex Ante and Ex Post Fairness in Resource Allocation

inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16647openalex-snapshot

Fair and Truthful Mechanisms for Dichotomous Valuations

inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16650openalex-snapshot

Achieving Proportionality up to the Maximin Item with Indivisible Goods

inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16665openalex-snapshot

Fair and Efficient Allocations under Subadditive Valuations

inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16672openalex-snapshot

Mind the Gap: Cake Cutting With Separation

inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16675openalex-snapshot

Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings

inferred← citeshttps://doi.org/10.1613/jair.1.13317openalex-snapshot

Ordinal Maximin Share Approximation for Goods

inferred← citeshttps://doi.org/10.24963/ijcai.2021/23openalex-snapshot

Graphical Cake Cutting via Maximin Share

inferred← citeshttps://doi.org/10.24963/ijcai.2021/34openalex-snapshot

Guaranteeing Maximin Shares: Some Agents Left Behind

inferred← citeshttps://doi.org/10.24963/ijcai.2022/108openalex-snapshot

Cluster Attack: Query-based Adversarial Attacks on Graph with Graph-Dependent Priors

inferred← citeshttps://doi.org/10.32657/10356/152488openalex-snapshot

Fair resource allocation in rich domains

inferred← citeshttps://doi.org/10.3390/app10082798openalex-snapshot

Fair Task Allocation When Cost of Task Is Multidimensional

inferred← citeshttps://doi.org/10.3390/math10030324openalex-snapshot

Towards Distributed Lexicographically Fair Resource Allocation with an Indivisible Constraint

inferred← citeshttps://doi.org/10.3390/math13132214openalex-snapshot

Max–Min Share-Based Mechanism for Multi-Resource Fair Allocation with Bounded Number of Tasks in Cloud Computing System

inferred← citeshttps://doi.org/10.48550/arxiv.1807.10684openalex-snapshot

Fair allocation of combinations of indivisible goods and chores

inferred← citeshttps://doi.org/10.48550/arxiv.1812.09561openalex-snapshot

The Fair Division of Hereditary Set Systems

inferred← citeshttps://doi.org/10.48550/arxiv.1902.04319openalex-snapshot

Envy-freeness up to any item with high Nash welfare: The virtue of donating items

inferred← citeshttps://doi.org/10.48550/arxiv.1903.00029openalex-snapshot

An Improved Approximation Algorithm for Maximin Shares

inferred← citeshttps://doi.org/10.48550/arxiv.1912.08763openalex-snapshot

The Maximin Share Dominance Relation

inferred← citeshttps://doi.org/10.48550/arxiv.2002.05119openalex-snapshot

EFX Exists for Three Agents

inferred← citeshttps://doi.org/10.48550/arxiv.2101.09794openalex-snapshot

Equitable Division of a Path

inferred← citeshttps://doi.org/10.48550/arxiv.2107.11648openalex-snapshot

Fair Allocation with Interval Scheduling Constraints

inferred← citeshttps://doi.org/10.48550/arxiv.2110.11285openalex-snapshot

How to Fairly Allocate Easy and Difficult Chores

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.