On the public citation graph

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

0 signed · 144 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-642-04428-1_9openalex-snapshot

On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences

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/bf01560582openalex-snapshot

Fair division under joint ownership: Recent results and open problems

inferredcites →https://doi.org/10.1007/s003550100119openalex-snapshot

A simple procedure for finding equitable allocations of indivisible goods

inferredcites →https://doi.org/10.1007/s100580050013openalex-snapshot

Fair allocation in a general model with indivisible goods

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

Uniform externalities

inferredcites →https://doi.org/10.1016/0165-4896(88)90047-9openalex-snapshot

Equitable distribution of indivisible objects

inferredcites →https://doi.org/10.1016/s0022-247x(03)00107-0openalex-snapshot

Maximin share and minimax envy in fair-division problems

inferredcites →https://doi.org/10.1016/s0165-0114(97)00168-1openalex-snapshot

k-order additive discrete fuzzy measures and their representation

inferredcites →https://doi.org/10.1017/cbo9780511800481.007openalex-snapshot

Combinatorial Algorithms for Market Equilibria

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

Axioms of Cooperative Decision Making

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

FAIR DIVISION OF INDIVISIBLE ITEMS

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

The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes

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

Optimal social choice functions

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/2600057.2602855openalex-snapshot

The complexity of fairness through equilibrium

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

On approximately fair allocations of indivisible goods

inferredcites →https://doi.org/10.1177/1043463105058317openalex-snapshot

Efficient Fair Division

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

Partitioning General Probability Measures

inferredcites →https://doi.org/10.1609/aaai.v28i1.8884openalex-snapshot

The Computational Rise and Fall of Fairness

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

Cooperative Microeconomics: A Game-Theoretic Introduction

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

Collective Choice and Social Welfare

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

Fair Division: From Cake-Cutting to Dispute Resolution.

inferredcites →https://doi.org/10.3233/978-1-60750-606-5-387openalex-snapshot

Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods

inferredcites →https://doi.org/10.3233/978-1-61499-419-0-423openalex-snapshot

Measuring Diversity of Preferences in a Group

inferredcites →https://doi.org/10.3233/978-1-61499-419-0-75openalex-snapshot

Scoring Rules for the Allocation of Indivisible Goods

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

Finding approximate competitive equilibria: efficient and fair course allocation

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

Fair assignment of indivisible objects under ordinal preferences

inferredcites →https://doi.org/10.65109/omut2311openalex-snapshot

On regular and approximately fair allocations of indivisible goods

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

Fair Division and Collective Welfare

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

Combinatorial Auctions

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

Multi-Unit Assignment under Dichotomous Preferences

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

Comparing Direct Algorithms for Two-Player Fair Division of Indivisible Items - A Computational Study

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

Multi-Unit Assignment Under Dichotomous Preferences

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

On the Optimal Rearrangement of Multiple Matrices

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

Fair and Truthful Mechanism with Limited Subsidy

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

On Achieving Leximin Fairness and Stability in Many-to-One Matchings

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-64946-3_26openalex-snapshot

Fair Division with Binary Valuations: One Rule to Rule Them All

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

Approximate Competitive Equilibrium with Generic Budget

inferred← citeshttps://doi.org/10.1007/978-3-030-87756-9_17openalex-snapshot

On Fairness via Picking Sequences in Allocation of Indivisible Goods

inferred← citeshttps://doi.org/10.1007/978-3-030-87756-9_19openalex-snapshot

Minimizing and Balancing Envy Among Agents Using Ordered Weighted Average

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

Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations

inferred← citeshttps://doi.org/10.1007/978-3-319-23114-3_31openalex-snapshot

Fairness and Rank-Weighted Utilitarianism in Resource Allocation

inferred← citeshttps://doi.org/10.1007/978-3-319-51753-7_9openalex-snapshot

Approximation Algorithms for Computing Maximin Share Allocations

inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_26openalex-snapshot

Approximate Maximin Share Allocations in Matroids

inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_4openalex-snapshot

Approximation Algorithms for Computing Maximin Share Allocations

inferred← citeshttps://doi.org/10.1007/978-3-662-48433-3_19openalex-snapshot

Characterization and Computation of Equilibria for Indivisible Goods

inferred← citeshttps://doi.org/10.1007/s00355-016-0982-zopenalex-snapshot

Proportional Borda allocations

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-016-9340-xopenalex-snapshot

Positional scoring-based allocation of indivisible goods

inferred← citeshttps://doi.org/10.1007/s10458-018-9393-0openalex-snapshot

Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods

inferred← citeshttps://doi.org/10.1007/s10458-019-09417-xopenalex-snapshot

Local envy-freeness in house allocation problems

inferred← citeshttps://doi.org/10.1007/s10458-020-09444-zopenalex-snapshot

Competitive equilibrium for almost all incomes: existence and fairness

inferred← citeshttps://doi.org/10.1007/s10479-025-06799-yopenalex-snapshot

The beautiful art of rearranging matrices

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

Fair assignment of indivisible objects under ordinal preferences

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

Computing a small agreeable set of indivisible items

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

Fair allocation of indivisible goods: Beyond additive valuations

inferred← citeshttps://doi.org/10.1016/j.comnet.2018.10.003openalex-snapshot

On efficient resource use for scientific workflows in clouds

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

Fairly allocating contiguous blocks of indivisible items

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

Two-player fair division of indivisible items: Comparison of algorithms

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.jmateco.2017.01.007openalex-snapshot

Fair and square: Cake-cutting in two dimensions

inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2017.05.006openalex-snapshot

Asymptotic existence of fair divisions for groups

inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2019.11.003openalex-snapshot

Multi-unit assignment under dichotomous preferences

inferred← citeshttps://doi.org/10.1016/j.orl.2015.10.001openalex-snapshot

Competitive equilibrium with equal incomes for allocation of indivisible objects

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

On maximin share allocations in matroids

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

Efficient reallocation under additive and responsive preferences

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

Local fairness in hedonic games via individual threshold coalitions

inferred← citeshttps://doi.org/10.1109/apsitt.2015.7217090openalex-snapshot

An allocation algorithm of indivisible goods

inferred← citeshttps://doi.org/10.1109/infocoman.2016.7784215openalex-snapshot

An online allocation algorithm of indivisible goods

inferred← citeshttps://doi.org/10.1109/nca.2017.8171368openalex-snapshot

Resource demand aware scheduling for workflows in clouds

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

A Little Charity Guarantees Almost Envy-Freeness

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

Fair enough

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

Two desirable fairness concepts for allocation of indivisible objects under ordinal preferences

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

The Unreasonable Fairness of Maximum Nash Welfare

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

Fair Enough

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

Approximation Algorithms for Computing Maximin Share Allocations

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

Fair Allocation of Indivisible Goods

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

Justifications of welfare guarantees under normalized utilities

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

Approximation Algorithms for Maximin Fair Division

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

EFX Exists for Three Agents

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.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/3503624openalex-snapshot

Toward Fair Recommendation in Two-sided Platforms

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

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

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

On Interim Envy-Free Allocation Lotteries

inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10041openalex-snapshot

When Can the Maximin Share Guarantee Be Guaranteed?

inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10582openalex-snapshot

Algorithms for Max-Min Share Fair Allocation of Indivisible Chores

inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11463openalex-snapshot

Groupwise Maximin Fair Allocation of Indivisible Goods

inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11484openalex-snapshot

The Conference Paper Assignment Problem: Using Order Weighted Averages to Assign Indivisible Goods

inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11590openalex-snapshot

Knowledge, Fairness, and Social Constraints

inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33011732openalex-snapshot

Fair Division with a Secretive Agent

inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33012141openalex-snapshot

Fairly Allocating Many Goods with Few Queries

inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33019921openalex-snapshot

Matroid Constrained Fair Allocation Problem

inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5572openalex-snapshot

The Complexity of Computing Maximin Share Allocations on Graphs

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

On Fair Division under Heterogeneous Matroid Constraints

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

On the PTAS for Maximin Shares in an Indivisible Mixed Manna

inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20407openalex-snapshot

Truthful and Fair Mechanisms for Matroid-Rank Valuations

inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25680openalex-snapshot

Fairness Concepts for Indivisible Items with Externalities

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

Improving Nash Social Welfare Approximations

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

Maximin Share Allocations on Cycles

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

Ordinal Maximin Share Approximation for Goods

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

Fair in the Eyes of Others

inferred← citeshttps://doi.org/10.24963/ijcai.2018/6openalex-snapshot

Comparing Approximate Relaxations of Envy-Freeness

inferred← citeshttps://doi.org/10.24963/ijcai.2019/42openalex-snapshot

Improving Nash Social Welfare Approximations

inferred← citeshttps://doi.org/10.24963/ijcai.2019/49openalex-snapshot

Achieving a Fairer Future by Changing the Past

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

Guaranteeing Maximin Shares: Some Agents Left Behind

inferred← citeshttps://doi.org/10.24963/ijcai.2023/276openalex-snapshot

Simplification and Improvement of MMS Approximation

inferred← citeshttps://doi.org/10.24963/ijcai.2023/286openalex-snapshot

Rainbow Cycle Number and EFX Allocations: (Almost) Closing the Gap

inferred← citeshttps://doi.org/10.24963/ijcai.2023/306openalex-snapshot

On Lower Bounds for Maximin Share Guarantees

inferred← citeshttps://doi.org/10.24963/ijcai.2023/315openalex-snapshot

Approximating Fair Division on D-Claw-Free Graphs

inferred← citeshttps://doi.org/10.24963/ijcai.2023/323openalex-snapshot

Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents

inferred← citeshttps://doi.org/10.24963/ijcai.2023/754openalex-snapshot

Complexity Results and Exact Algorithms for Fair Division of Indivisible Items: A Survey

inferred← citeshttps://doi.org/10.24963/ijcai.2023/778openalex-snapshot

Ordinal Maximin Share Approximation for Goods (Extended Abstract)

inferred← citeshttps://doi.org/10.3233/faia230396openalex-snapshot

The Leximin Approach for a Sequence of Collective Decisions

inferred← citeshttps://doi.org/10.3233/faia230522openalex-snapshot

On the Price of Fairness in the Connected Discrete Cake Cutting Problem

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

Egalitarianism of Random Assignment Mechanisms

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

Assigning a Small Agreeable Set of Indivisible Items to Multiple Players

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

Fair Allocation of Indivisible Goods: Improvement and Generalization

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

Fair Division Under Cardinality Constraints

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

EFX Exists for Three Agents

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

Nash Social Welfare for 2-value Instances

inferred← citeshttps://doi.org/10.5281/zenodo.203164openalex-snapshot

FIGURE 9 in Coarazuphium tapiaguassu (Coleoptera: Carabidae: Zuphiini), a new Brazilian troglobitic beetle, with ultrastructural analysis and ecological considerations

inferred← citeshttps://doi.org/10.5555/2615731.2617456openalex-snapshot

Fair assignment of indivisible objects under ordinal preferences

inferred← citeshttps://doi.org/10.5555/2936924.2936961openalex-snapshot

Local Fairness in Hedonic Games via Individual Threshold Coalitions

inferred← citeshttps://doi.org/10.5555/2936924.2937113openalex-snapshot

Egalitarianism of Random Assignment Mechanisms: (Extended Abstract)

inferred← citeshttps://doi.org/10.65109/ayhc6673openalex-snapshot

Guaranteeing Half-Maximin Shares Under Cardinality Constraints

inferred← citeshttps://doi.org/10.65109/gvai1788openalex-snapshot

Fairness in Multiagent Resource Allocation with Dynamic and Partial Observations

inferred← citeshttps://doi.org/10.65109/lyep9074openalex-snapshot

Optimal Reallocation under Additive and Ordinal Preferences

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.