On the public citation graph
Almost (Weighted) Proportional Allocations for Indivisible Chores✱✱
0 signed · 60 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-3-030-64946-3_25openalex-snapshot
Optimal Bounds on the Price of Fairness for Indivisible Goods
inferredcites →https://doi.org/10.1007/978-3-642-10841-9_45openalex-snapshot
The Efficiency of Fair Division
inferredcites →https://doi.org/10.1007/s10107-022-01855-yopenalex-snapshot
Approximate and strategyproof maximin share allocation of chores with ordinal preferences
inferredcites →https://doi.org/10.1007/s10458-015-9287-3openalex-snapshot
Characterizing conflicts in fair division of indivisible goods using a scale of criteria
inferredcites →https://doi.org/10.1016/j.ic.2021.104739openalex-snapshot
Allocating contiguous blocks of indivisible chores fairly
inferredcites →https://doi.org/10.1016/j.orl.2020.07.005openalex-snapshot
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
inferredcites →https://doi.org/10.1016/j.tcs.2015.05.041openalex-snapshot
Dividing connected chores fairly
inferredcites →https://doi.org/10.1016/j.tcs.2021.02.020openalex-snapshot
Maximum Nash Welfare and Other Stories About EFX
inferredcites →https://doi.org/10.1080/00029890.1999.12005142openalex-snapshot
Rental Harmony: Sperner's Lemma in Fair Division
inferredcites →https://doi.org/10.1086/664613openalex-snapshot
The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
inferredcites →https://doi.org/10.1109/focs.2016.52openalex-snapshot
A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents
inferredcites →https://doi.org/10.1137/1.9781611975031.165openalex-snapshot
Almost Envy-Freeness with General Valuations
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/3355902openalex-snapshot
The Unreasonable Fairness of Maximum Nash Welfare
inferredcites →https://doi.org/10.1145/3457166openalex-snapshot
Weighted Envy-Freeness in Indivisible Item Allocation
inferredcites →https://doi.org/10.1145/3465456.3467555openalex-snapshot
An Algorithmic Framework for Approximating Maximin Share Allocation of Chores
inferredcites →https://doi.org/10.1145/3465456.3467559openalex-snapshot
Fair-Share Allocations for Agents with Arbitrary Entitlements
inferredcites →https://doi.org/10.1145/988772.988792openalex-snapshot
On approximately fair allocations of indivisible goods
inferredcites →https://doi.org/10.1146/annurev-economics-080218-025559openalex-snapshot
Fair Division in the Internet Age
inferredcites →https://doi.org/10.1287/moor.2020.1062openalex-snapshot
Competitive Equilibrium with Indivisible Goods and Generic Budgets
inferredcites →https://doi.org/10.1609/aaai.v31i1.10582openalex-snapshot
Algorithms for Max-Min Share Fair Allocation of Indivisible Chores
inferredcites →https://doi.org/10.1609/aaai.v32i1.11463openalex-snapshot
Groupwise Maximin Fair Allocation of Indivisible Goods
inferredcites →https://doi.org/10.1613/jair.1.11291openalex-snapshot
Fair Allocation of Indivisible Goods to Asymmetric Agents
inferredcites →https://doi.org/10.24963/ijcai.2019/12openalex-snapshot
The Price of Fairness for Indivisible Goods
inferredcites →https://doi.org/10.24963/ijcai.2019/7openalex-snapshot
Weighted Maxmin Fair Share Allocation of Indivisible Chores
inferredcites →https://doi.org/10.24963/ijcai.2021/32openalex-snapshot
Fair and Efficient Resource Allocation with Partial Information
inferredcites →https://doi.org/10.4230/lipics.approx/random.2021.1openalex-snapshot
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
inferredcites →https://doi.org/10.48550/arxiv.1605.04026openalex-snapshot
On Truthful Mechanisms for Maximin Share Allocations
inferredcites →https://doi.org/10.48550/arxiv.2102.10654openalex-snapshot
(Almost Full) EFX Exists for Four Agents (and Beyond)
inferredcites →https://doi.org/10.5281/zenodo.3911429openalex-snapshot
Algorithms for Max-Min Share Fair Allocation of Indivisible Chores
inferredcites →https://doi.org/10.5555/2615731.2617458openalex-snapshot
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.2139/ssrn.4756346openalex-extracted
Efx Allocations for Indivisible Chores: Matching-Based Approach
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-43254-5_15openalex-snapshot
EFX Allocations for Indivisible Chores: Matching-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-48974-7_33openalex-snapshot
One Quarter Each (on Average) Ensures Proportionality
inferred← citeshttps://doi.org/10.1007/978-3-031-49614-1_21openalex-snapshot
EFX Allocation to Chores over Small Graph
inferred← citeshttps://doi.org/10.1007/978-3-032-08560-3_17openalex-snapshot
Tree Splitting Based Rounding Scheme for Weighted Proportional Allocations with Subsidy
inferred← citeshttps://doi.org/10.1007/978-3-032-08560-3_32openalex-snapshot
A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
inferred← citeshttps://doi.org/10.1007/978-981-95-4839-2_12openalex-snapshot
Approximating EFX Through a New Notion of Fairness
inferred← citeshttps://doi.org/10.1007/978-981-95-4839-2_4openalex-snapshot
Approximate EFX and Efficient Allocations of Chores for Bounded Preferences
inferred← citeshttps://doi.org/10.1007/978-981-97-7752-5_3openalex-snapshot
On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores
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.1016/j.tcs.2024.115010openalex-snapshot
EFX allocations for indivisible chores: Matching-based approach
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115248openalex-snapshot
On the existence of EFX (and Pareto-optimal) allocations for binary chores
inferred← citeshttps://doi.org/10.1145/3572885.3572887openalex-snapshot
Algorithmic fair allocation of indivisible items
inferred← citeshttps://doi.org/10.1145/3617694.3623229openalex-snapshot
Average Envy-freeness for Indivisible Items
inferred← citeshttps://doi.org/10.1145/3618116openalex-snapshot
Unified Fair Allocation of Goods and Chores via Copies
inferred← citeshttps://doi.org/10.1145/3717823.3718305openalex-snapshot
Constant-Factor EFX Exists for Chores
inferred← citeshttps://doi.org/10.2139/ssrn.6258609openalex-snapshot
Efficient Mechanism Design with Distributional Objectives and Ties
inferred← citeshttps://doi.org/10.24963/ijcai.2022/110openalex-snapshot
Approximately EFX Allocations for Indivisible Chores
inferred← citeshttps://doi.org/10.24963/ijcai.2023/277openalex-snapshot
Fair and Efficient Allocation of Indivisible Chores with Surplus
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.3390/math11163616openalex-snapshot
A Survey on Fair Allocation of 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.