Paper Citation Record · LEDGER

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO

As of 19 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2607.23367.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.23367 v1

Coverage vector

measured 18 of 18 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-31T23:47:37.347691Z

measured 18 of 18 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

18 of 18 outbound references displayed

verified exact0
verified fuzzy0
unresolved18
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 95a1566c-942d-4f0d-b304-916eaa97b567 · outbound

This paper cites Voudouris, and Xiaowei Wu.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Voudouris, and Xiaowei Wu

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:35.852254Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation acfde9af-4910-41e9-a360-55aef46ea6e9 · outbound

This paper cites Fair allocation of indivisible goods and chores.Autonomous Agents and Multi-Agent Systems, 36(3), 2022.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Fair allocation of indivisible goods and chores.Autonomous Agents and Multi-Agent Systems, 36(3), 2022

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:35.923344Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0ab039a-b3ae-41d0-98ea-a823aa082fc7 · outbound

This paper cites Compatibility of fairness and Nash welfare under subadditive valuations.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Compatibility of fairness and Nash welfare under subadditive valuations

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:36.008182Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 40397f21-3d0a-4e49-99c0-300ec78409fb · outbound

This paper cites Finding fair and efficient allocations.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Finding fair and efficient allocations

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:36.092633Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b8ca8e61-6397-46db-ab47-f2f00e927c7f · outbound

This paper cites Finding fair and efficient allocations for matroid rank valuations.ACM Transactions on Economics and Computation, 9: 1–41, 2021.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Finding fair and efficient allocations for matroid rank valuations.ACM Transactions on Economics and Computation, 9: 1–41, 2021

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:36.177349Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c466ed0c-8d99-4110-9f3e-b8ecfa8e131c · outbound

This paper cites an unresolved cited work.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Unresolved cited work

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:36.257060Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 555f36bd-ac78-4499-9190-ce0c070f4e83 · outbound

This paper cites Fair Division with Binary Valuations: Characterizations.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Fair Division with Binary Valuations: Characterizations

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:36.343675Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ea7bf989-8d67-4543-842a-9129b1144acc · outbound

This paper cites The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes.Journal of Political Economy, 119(6):1061–1103, 2011.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes.Journal of Political Economy, 119(6):1061–1103, 2011

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:36.432992Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bb4d1711-d7b1-446e-9e84-682bf0f603ef · outbound

This paper cites Procaccia, Nisarg Shah, and Junxing Wang.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Procaccia, Nisarg Shah, and Junxing Wang

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:36.510950Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 78756d7d-3afa-487f-89ad-0963f624b8b8 · outbound

This paper cites Nonexistence of Simultaneously EF1 and Pareto Optimal Allocations for Submodular Valuations.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Nonexistence of Simultaneously EF1 and Pareto Optimal Allocations for Submodular Valuations

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:36.588289Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cb846b07-924b-4077-89d2-b25135a8fa44 · outbound

This paper cites Computing the optimal strategy to commit to.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Computing the optimal strategy to commit to

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:36.706486Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 211cb80b-1854-4d59-bb3d-afd1613f4f72 · outbound

This paper cites Fair distribution of delivery orders.Artificial Intelligence, 347:104389, 2025.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Fair distribution of delivery orders.Artificial Intelligence, 347:104389, 2025

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:36.769330Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 974654d1-a515-4d16-b743-656a6b18e982 · outbound

This paper cites The cost of EFX: Generalized-mean welfare and complexity dichotomies with few surplus items.arXiv preprint arXiv:2601.12849, 2026.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO The cost of EFX: Generalized-mean welfare and complexity dichotomies with few surplus items.arXiv preprint arXiv:2601.12849, 2026

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:36.838132Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 85f201ad-58ae-4bfa-90e8-fb73912af3f5 · outbound

This paper cites Lipton, Evangelos Markakis, Elchanan Mossel, and Amin Saberi.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Lipton, Evangelos Markakis, Elchanan Mossel, and Amin Saberi

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:36.937595Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e3e59866-db37-4f07-bfb4-4bb2745c9bc8 · outbound

This paper cites When One Good Is Not Enough: EF1 and Pareto Optimality Are Not Compatible for Submodular Valuations.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO When One Good Is Not Enough: EF1 and Pareto Optimality Are Not Compatible for Submodular Valuations

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:36.977797Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 986f1b89-4e60-4ea0-bcbb-bdd34628a8b8 · outbound

This paper cites Existence of fair and efficient allocation of indivisible chores.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Existence of fair and efficient allocation of indivisible chores

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:37.055982Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0f859d8c-c067-4235-8119-76e4d9905da9 · outbound

This paper cites Almost envy-freeness with general valuations.SIAM Journal on Discrete Mathematics, 34(2):1039–1068, 2020.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Almost envy-freeness with general valuations.SIAM Journal on Discrete Mathematics, 34(2):1039–1068, 2020

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:37.189119Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12957142-3bb1-4331-9181-e805ec5e981f · outbound

This paper cites Computing fair and efficient indivisible chore allocations with bounded surplus.

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO Computing fair and efficient indivisible chore allocations with bounded surplus

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-31T23:47:37.347691Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.