Pith. sign in

REVIEW 5 minor 65 references

Best-of-Both-Worlds Fairness for Mixed Goods and Chores

T0 review · 0 major / 5 minor · reviewed 2026-07-14 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A single lottery can be exactly envy-free in expectation and still only produce allocations that are fair up to one item, even when the same item is a good for some agents and a chore for others.

desk verdict Clean existence proof that settles the mixed-manna BoBW open question with a reusable probabilistic Hall decomposition. read the letter →

arxiv 2607.10232 v1 pith:MM72S4BO submitted 2026-07-11 cs.GT

Haris Aziz , Xiaolin Bu , Xinhang Lu , Simon Mackenzie , Mashbat Suzuki , Biaoshuai Tao , Toby Walsh This is my paper · ORCID
classification cs.GT MSC 91B3268Q2590C27
keywords fairdivisionmixedgoodsandchoresenvy-freenessEF1best-of-both-worldsprobabilisticserialHall-typedecompositionSionminimax
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

When indivisible items must be shared and the same item can be desirable to one person and burdensome to another, exact envy-freeness is often impossible after the items are handed out. The paper shows that randomization still lets you have both worlds at once: the lottery itself is completely envy-free in expectation, yet every concrete allocation that can actually occur is envy-free up to the removal of a single item. The technical heart is a new way to correlate the random assignment of goods with the random assignment of chores so that the two sides of the problem do not add up their approximation errors. The result settles an open question for the mixed setting and gives a concrete algorithmic route that first bundles items into a clean structural form and then decomposes a carefully chosen fractional allocation.

What carries the argument

A probabilistic Hall-type matrix decomposition: a distribution over size-r matchings that realizes a given fractional bipartite matching while obeying a family of concentration bounds on every interest set; existence is proved by lifting the bounds to continuous weight vectors, applying Sion's minimax theorem, and constructing a biased flow network whose integral flows yield the desired lottery.

What would settle it

Exhibit a concrete additive instance of mixed goods and chores for which every lottery that is envy-free in expectation places positive probability on at least one integral allocation that is not EF1, or show that the claimed Hall-type decomposition does not exist for some fractional matrix satisfying the row- and column-sum hypotheses.

Watch

Extended reading notes

Core claim

Under additive valuations, for any collection of mixed goods and chores there always exists a randomized allocation that is envy-free ex ante and is supported exclusively on integral allocations that satisfy envy-freeness up to one item.

Load-bearing premise

The preprocessing that packs items must leave interest sets pairwise disjoint and chore-maximal, and the first-round chore matchings must always admit a decomposition that meets the probabilistic Hall condition; if either structural guarantee fails, the reduction no longer guarantees EF1 after unbundling.

Editorial extensions

If this is right

  • Any fair-division system that already randomizes can upgrade to simultaneous ex-ante EF and ex-post EF1 for mixed items without changing the agents' reported additive valuations.
  • The same correlation technique immediately yields an analogous guarantee when preferences are only ordinal, but only up to EF2 rather than EF1.
  • The probabilistic Hall decomposition supplies a reusable black-box for other problems that need to couple several fractional matchings while controlling concentration on designated subsets.
  • Once an efficient implementation of the decomposition is found, the entire construction becomes polynomial-time, giving a practical algorithm for the mixed setting.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same flow-plus-minimax template may resolve other open 'best-of-both-worlds' questions that currently stop at EF2 because independent lotteries cannot be correlated tightly enough.
  • Because the argument never uses more than additivity, any future extension to non-additive valuations will have to replace both the bundling step and the Hall-type condition rather than merely re-running the existing lottery.
  • The clean separation into a hard case (more chores than agents) and an easy case (at most n chores) suggests that the mixed problem is combinatorially closer to pure chores than pure goods once the interest sets are made disjoint.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 5 minor

Summary. The paper studies best-of-both-worlds fairness for indivisible mixed goods and chores under additive valuations: items may be goods for some agents and chores for others. The main result (Theorem 1.1) is that there always exists a randomized allocation that is exactly envy-free ex ante and supported only on integral EF1 allocations. After a bundling preprocessing that produces pairwise-disjoint, chore-maximal interest sets, the argument splits into a hard case (|Z| > n) and an easy case (|Z| ≤ n). In the hard case a target EF fractional allocation is defined via equal division of subjective goods within interest sets and recursive Probabilistic Serial on chores (padded by dummies); the key technical step is a novel probabilistic Hall-type decomposition of the first-round size-r matching that correlates goods and chores, proved by lifting subset constraints to a continuous weighted form, applying Sion’s minimax theorem, and constructing a biased multi-chain flow network whose integral flows yield the desired lottery. Subjective goods are then assigned by a max-flow argument that respects the Hall condition and the EF1 synchronization rule. The easy case uses a secondary good-minimality/small-goods-only preprocessing followed by a three-step combinatorial lottery (random chore assignment, serial dictatorship on goods for chore recipients, PS-lottery for the rest) whose ex-ante EF is established by coupling. An appendix shows that the ordinal analogues yield ex-ante SD-EF + ex-p

Significance. The result settles Open Question 4 of the Liu et al. (2024) survey for the mixed setting and extends the classical BoBW theorems of Freeman et al. / Aziz et al. beyond pure goods or pure chores. The probabilistic Hall-type matrix decomposition (Theorems 4.6 and 4.10), obtained by combining Sion minimax with carefully capacity-biased flow networks, is a clean and reusable combinatorial tool that should find applications to other correlated matching and lottery problems. Full, self-contained proofs are supplied for both cases; standard lemmas (Sion, flow integrality, PS round-ordering) are invoked correctly. The only acknowledged limitation is that a direct realization of the Hall decomposition is exponential-time; existence itself is unconditional. Overall this is a substantial and technically polished contribution to fair division.

minor comments (5)
  1. Section 6 notes that the Hall decomposition is the sole non-polynomial component, yet the discussion is brief. A short paragraph clarifying that the existence proof is non-constructive in poly-time (and that an oracle or separation-based implementation remains open) would help readers who care about algorithmic realization.
  2. The multi-set flow network (Appendix A.1 / Figure 3) is dense. Adding one intermediate claim that flow conservation on each parallel chain is independent of the others (by disjointness of the T_i) would make the bookkeeping easier to verify on a first reading.
  3. Minor typographical issues appear throughout (e.g., missing spaces after “(EF)” and “(EF1)” in the abstract and introduction; occasional “Theorem 4.9” vs. “Lemma 4.9” label inconsistency in the single-set case). A careful copy-edit pass is warranted.
  4. In the easy-case coupling argument (Lemma 5.2), the pairing of outcomes is described clearly for the two agents under consideration, but a one-sentence reminder that the remaining agents’ assignments are held fixed would remove any residual ambiguity.
  5. Proposition 2.3 is cited for both PS-lottery and recursive PS; a parenthetical note that the same ordering property holds after dummy padding for subjective goods would make the later extensions self-contained.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: pure existence proof; target fractional allocation defined independently of the lottery that realizes it.

full rationale

The paper is a self-contained combinatorial existence argument. The target fractional allocation (equal shares of each subjective good within its interest set + recursive PS on objective chores padded with dummies) is defined first (Section 4, before Lemmas 4.1–4.3). The subsequent lottery is then shown to implement exactly those marginals while also satisfying the extra probabilistic Hall-type condition (Eq. 3) needed for ex-post EF1. That condition is proved from first principles: continuous weighted reformulation of the exponential family of subset constraints, Sion’s minimax theorem (external, classical) to swap quantifiers, and an explicit biased flow network whose integral capacities encode the known row sums r/n; flow-integrality then yields a distribution meeting every chain bound simultaneously (Theorem 4.6 / 4.10 and Appendix A.1). The easy case is an independent coupling argument. Prior BoBW citations (PS / recursive PS) are used only as black-box building blocks for pure-goods or pure-chores subroutines; they are not load-bearing for the novel correlation step. No parameters are fitted, no uniqueness is imported from the authors’ own prior work, and no quantity is redefined as its own prediction. Hence score 0.

Assumptions & free parameters 0 free parameters · 4 assumptions · 2 invented entities

Standard mathematical toolkit (Sion minimax, totally-unimodular flow integrality, PS properties) plus the domain model of additive mixed manna. No free parameters or fitted constants. The only invented objects are the technical devices (Hall-type condition, biased chain networks) introduced to prove the existence claim; they have no independent physical status.

assumptions (4)
  • domain assumption Agents have additive valuation functions over items (vi(S) = sum vi(h) for h in S).
    Stated in Section 2; used throughout all utility calculations and EF/EF1 definitions.
  • standard math Sion's minimax theorem applies to the continuous weighted reformulation over compact convex sets.
    Invoked as Theorem 4.4 to swap min_λ max_w g(λ,w).
  • standard math Integral flows of a network with integral capacities can be written as convex combinations of integral feasible flows (flow-integrality lemma).
    Lemma 4.5; used to turn the fractional biased flow into a lottery over matchings.
  • domain assumption The recursive Probabilistic Serial rule yields ex-ante EF and ex-post EF1 (or EF2 when run separately) on pure subjective goods or pure objective chores.
    Cited from Aziz et al. 2024a / Freeman et al.; used as black-box for the chore lottery and the easy-case leftover goods.
invented entities (2)
  • Probabilistic Hall-type condition (Eq. 3 / Theorem 4.10)
    purpose: Ensures that first-round chore matchings do not concentrate too heavily on any subset of an interest set, enabling synchronized allocation of subjective goods while preserving marginals and EF1.
    Defined and proved for the paper; no prior independent evidence outside this construction.
  • Biased multi-chain flow networks with local sorting by weight vectors
    purpose: Construct, for each fixed weight vector, a distribution over size-r matchings that satisfies the weighted concentration bounds needed for the minimax argument.
    Custom network topology introduced in Section 4.1 and Appendix A; purely instrumental.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Best-of-Both-Worlds Fairness for Mixed Goods and Chores." pith.science (2026). https://pith.science/paper/MM72S4BO

@misc{pith2026260710232,
  author       = {Pith},
  title        = {Pith review of: Best-of-Both-Worlds Fairness for Mixed Goods and Chores},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/MM72S4BO}},
  note         = {Machine review of arXiv:2607.10232}
}
read the original abstract

We study the fundamental problem of fairly dividing indivisible items among agents with additive utilities. In our model, an item can be a good yielding non-negative utilities to some agents and simultaneously a chore yielding negative utilities to others. We take the best-of-both-worlds perspective and our goal is to construct a randomized allocation that is exactly fair ex ante while also being supported on ex post approximately fair allocations. The fairness notions examined in this paper are envy-freeness (EF) and its well-known relaxation envy-freeness up to one item (EF1). Our main result is that ex-ante EF and ex-post EF1 can be achieved simultaneously. To achieve this, we introduce a novel probabilistic Hall-type matrix decomposition that intricately correlates the fractional assignments of goods and chores. We resolve this decomposition problem by combining continuous minimax duality -- via Sion's minimax theorem -- with carefully designed biased flow networks.

Figures

Figures reproduced from arXiv: 2607.10232 by the authors.

Figure 1
Figure 1. The flow network for the proof of Lemma 4.3. An intermediate edge (i, µi ′) represents that assigning Mj to agent i under matching µi ′ does not violate the constraint in Lemma 4.2. edge with capacity 1 t from s to each i ∈ [t]. The second set contains t ′ vertices, each representing a matching in the support. With a slight abuse of notation, we denote the vertices by {µ1, . . . , µt ′}. There is an edge with capaci… view at source ↗
Figure 2
Figure 2. The flow network used in the proof of Theorem [PITH_FULL_IMAGE:figures/full_fig_p019_2.png] view at source ↗
Figure 3
Figure 3. Flow network used in the proof of Theorem [PITH_FULL_IMAGE:figures/full_fig_p032_3.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

65 extracted references

  1. [1]

    Proceedings of the 25th ACM Conference on Economics and Computation (EC) , year =

    Akrami, Hannaneh and Garg, Jugal and Sharma, Eklavya and Taki, Setareh , title =. Proceedings of the 25th ACM Conference on Economics and Computation (EC) , year =

  2. [2]

    Proceedings of the 37th Conference on Neural Information Processing Systems (NeurIPS) , year =

    Akrami, Hannaneh and Mehlhorn, Kurt and Seddighin, Masoud and Shahkarami, Golnoosh , title =. Proceedings of the 37th Conference on Neural Information Processing Systems (NeurIPS) , year =

  3. [3]

    Fair Division of Indivisible Goods: Recent Progress and Open Questions , journal =

    Amanatidis, Georgios and Aziz, Haris and Birmpas, Georgios and Filos-Ratsikas, Aris and Li, Bo and Moulin, Herv\'. Fair Division of Indivisible Goods: Recent Progress and Open Questions , journal =. 2023 , volume =

    2023

  4. [4]

    Proceedings of the 16th International Conference on Web and Internet Economics (WINE) , year =

    Aziz, Haris , title =. Proceedings of the 16th International Conference on Web and Internet Economics (WINE) , year =

  5. [5]

    Autonomous Agents and Multi-Agent Systems , volume =

    Aziz, Haris and Caragiannis, Ioannis and Igarashi, Ayumi and Walsh, Toby , title =. Autonomous Agents and Multi-Agent Systems , volume =. 2022 , pages =

    2022

  6. [6]

    Operations Research , volume =

    Aziz, Haris and Freeman, Rupert and Shah, Nisarg and Vaish, Rohit , title =. Operations Research , volume =. 2024 , pages =

    2024

  7. [7]

    Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS) , year =

    Aziz, Haris and Ganguly, Aditya and Micha, Evi , title =. Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS) , year =

  8. [8]

    Proceedings of the 27th ACM Conference on Economics and Computation (EC) , year =

    Aziz, Haris and Lu, Xinhang and Mackenzie, Simon and Suzuki, Mashbat , title =. Proceedings of the 27th ACM Conference on Economics and Computation (EC) , year =

Show all 65 references
  1. [9]

    Proceedings of the 19th Conference on Web and Internet Economics (WINE) , year =

    Aziz, Haris and Lu, Xinhang and Suzuki, Mashbat and Vollen, Jeremy and Walsh, Toby , title =. Proceedings of the 19th Conference on Web and Internet Economics (WINE) , year =

  2. [10]

    Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI) , year =

    Aziz, Haris and Lu, Xinhang and Suzuki, Mashbat and Vollen, Jeremy and Walsh, Toby , title =. Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI) , year =

  3. [11]

    A Polynomial-time Algorithm for Computing a

    Aziz, Haris and Moulin, Herv\'. A Polynomial-time Algorithm for Computing a. Operations Research Letters , volume =. 2020 , pages =

    2020

  4. [12]

    Proceedings of the 21st Conference on Web and Internet Economics (WINE) , year =

    Barman, Siddharth and HV, Vishwa Prakash and Sethia, Aditi and Suzuki, Mashbat , title =. Proceedings of the 21st Conference on Web and Internet Economics (WINE) , year =

  5. [13]

    CoRR , volume =

    Barman, Siddharth and Verma, Paritosh , title =. CoRR , volume =

  6. [14]

    Proceedings of the 18th Conference on Web and Internet Economics (WINE) , year =

    Babaioff, Moshe and Ezra, Tomer and Feige, Uriel , title =. Proceedings of the 18th Conference on Web and Internet Economics (WINE) , year =

  7. [15]

    Best of Both Worlds Guarantees for Equitable Allocations , booktitle =

    Bhaskar, Umang and HV, Vishwa Prakash and Sethia, Aditi and. Best of Both Worlds Guarantees for Equitable Allocations , booktitle =. 2026 , pages =

    2026

  8. [16]

    Bhaskar, Umang and Sricharan, A. R. and Vaish, Rohit , title =. Proceedings of the 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) , year =

  9. [17]

    Journal of Economic Theory , volume =

    Bogomolnaia, Anna , title =. Journal of Economic Theory , volume =. 2015 , pages =

    2015

  10. [18]

    A New Solution to the Random Assignment Problem , journal =

    Bogomolnaia, Anna and Moulin, Herv\'. A New Solution to the Random Assignment Problem , journal =. 2001 , pages =

    2001

  11. [19]

    Competitive Division of a Mixed Manna , journal =

    Bogomolnaia, Anna and Moulin, Herv\'. Competitive Division of a Mixed Manna , journal =. 2017 , pages =

    2017

  12. [20]

    Collective Choice Under Dichotomous Preferences , journal =

    Bogomolnaia, Anna and Moulin, Herv\'. Collective Choice Under Dichotomous Preferences , journal =. 2005 , pages =

    2005

  13. [21]

    and Taylor, Alan D

    Brams, Steven J. and Taylor, Alan D. , title =

  14. [22]

    Proceedings of the 22nd ACM Conference on Economics and Computation (EC) , year =

    Brandl, Florian and Brandt, Felix and Peters, Dominik and Stricker, Christian , title =. Proceedings of the 22nd ACM Conference on Economics and Computation (EC) , year =

  15. [23]

    Handbook of Computational Social Choice , publisher =

  16. [24]

    Journal of Political Economy , volume =

    Budish, Eric , title =. Journal of Political Economy , volume =. 2011 , pages =

    2011

  17. [25]

    Proceedings of the 20th Conference on Web and Internet Economics (WINE) , year =

    Bu, Xiaolin and Li, Zihao and Liu, Shengxin and Lu, Xinhang and Tao, Biaoshuai , title =. Proceedings of the 20th Conference on Web and Internet Economics (WINE) , year =

  18. [26]

    CoRR , volume =

    Bu, Xiaolin and Tao, Biaoshuai , title =. CoRR , volume =

  19. [27]

    Budish, Eric and Cachon, G\'. Course. Operations Research , volume =. 2017 , pages =

    2017

  20. [28]

    American Economic Review , volume =

    Budish, Eric and Che, Yeon-Koo and Kojima, Fuhito and Milgrom, Paul , title =. American Economic Review , volume =. 2013 , pages =

    2013

  21. [29]

    The Unreasonable Fairness of Maximum

    Caragiannis, Ioannis and Kurokawa, David and Moulin, Herv\'. The Unreasonable Fairness of Maximum. ACM Transactions on Economics and Computation , volume =. 2019 , pages =

    2019

  22. [30]

    Mathematics of Operations Research , volume =

    Chaudhury, Bhaskar Ray and Garg, Jugal and McGlaughlin, Peter and Mehta, Ruta , title =. Mathematics of Operations Research , volume =. 2023 , pages =

    2023

  23. [31]

    and Ponitka, Tomasz , title =

    Feldman, Michal and Mauras, Simon and Narayan, Vishnu V. and Ponitka, Tomasz , title =. Proceedings of the 25th ACM Conference on Economics and Computation (EC) , year =

  24. [32]

    Yale Economics Essays , volume =

    Foley, Duncan Karl , title =. Yale Economics Essays , volume =. 1967 , pages =

    1967

  25. [33]

    Proceedings of the 21st ACM Conference on Economics and Computation , year =

    Freeman, Rupert and Shah, Nisarg and Vaish, Rohit , title =. Proceedings of the 21st ACM Conference on Economics and Computation , year =

  26. [34]

    Journal of Artificial Intelligence Research , volume =

    Garg, Jugal and McGlaughlin, Peter and Hoefer, Martin and Schmalhofer, Marco , title =. Journal of Artificial Intelligence Research , volume =. 2023 , pages =

    2023

  27. [35]

    , title =

    Goldman, Jonathan and Procaccia, Ariel D. , title =. SIGecom Exchanges , volume =. 2015 , pages =

    2015

  28. [36]

    In This Apportionment Lottery, the House Always Wins , journal =

    G\". In This Apportionment Lottery, the House Always Wins , journal =. 2026 , pages =

    2026

  29. [37]

    The American Mathematical Monthly , volume =

    Grimmett, Geoffrey , title =. The American Mathematical Monthly , volume =. 2004 , pages =

    2004

  30. [38]

    Mathematics , volume =

    Guo, Hao and Li, Weidong and Deng, Bin , title =. Mathematics , volume =. 2023 , pages =

    2023

  31. [39]

    Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems (AAMAS) , year =

    H.V., Vishwa Prakash and Nimbhorkar, Prajakta , title =. Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems (AAMAS) , year =

  32. [40]

    Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI) , year =

    Han, Jiatong and Suksompong, Warut , title =. Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI) , year =

  33. [41]

    Journal of Artificial Intelligence Research , volume =

    Hoefer, Martin and Schmalhofer, Marco and Varricchio, Giovanna , title =. Journal of Artificial Intelligence Research , volume =. 2024 , pages =

    2024

  34. [42]

    CoRR , volume =

    Hosseini, Hadi and Sethia, Aditi , title =. CoRR , volume =

  35. [43]

    Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS) , year =

    Hosseini, Hadi and Sikdar, Sujoy and Vaish, Rohit and Xia, Lirong , title =. Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS) , year =

  36. [44]

    Journal of Political Economy , volume =

    Hylland, Aanund and Zeckhauser, Richard , title =. Journal of Political Economy , volume =. 1979 , pages =

    1979

  37. [45]

    Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI) , year =

    Igarashi, Ayumi and Yokoyama, Tomohiko , title =. Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI) , year =

  38. [46]

    CoRR , volume =

    Kavitha, Telikepalli and Panchapakesan, Surya and Vaish, Rohit and Viswanathan, Vignesh and Yadav, Jatin , title =. CoRR , volume =

  39. [47]

    Kodai Mathematical Journal , volume =

    Komiya, Hidetoshi , title =. Kodai Mathematical Journal , volume =. 1988 , pages =

    1988

  40. [48]

    Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI) , year =

    Kulkarni, Rucha and Mehta, Ruta and Taki, Setareh , title =. Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI) , year =

  41. [49]

    Proceedings of the 22nd ACM Conference on Economics and Computation (EC) , year =

    Kulkarni, Rucha and Mehta, Ruta and Taki, Setareh , title =. Proceedings of the 22nd ACM Conference on Economics and Computation (EC) , year =

  42. [50]

    and Markakis, Evangelos and Mossel, Elchanan and Saberi, Amin , title =

    Lipton, Richard J. and Markakis, Evangelos and Mossel, Elchanan and Saberi, Amin , title =. Proceedings of the 5th ACM Conference on Electronic Commerce (EC) , year =

  43. [51]

    Journal of Artificial Intelligence Research , volume =

    Liu, Shengxin and Lu, Xinhang and Suzuki, Mashbat and Walsh, Toby , title =. Journal of Artificial Intelligence Research , volume =. 2024 , pages =

    2024

  44. [52]

    Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS) , year =

    Livanos, Vasilis and Mehta, Ruta and Murhekar, Aniket , title =. Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS) , year =

  45. [53]

    Proceedings of the 37th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , year =

    Mahara, Ryoga , title =. Proceedings of the 37th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , year =

  46. [54]

    Fair Division and Collective Welfare , publisher =

    Moulin, Herv\'. Fair Division and Collective Welfare , publisher =

  47. [55]

    Fair Division in the Internet Age , journal =

    Moulin, Herv\'. Fair Division in the Internet Age , journal =. 2019 , pages =

    2019

  48. [56]

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

    Nguyen, Trung Thanh and Rothe, J\". Complexity Results and Exact Algorithms for Fair Division of Indivisible Items:. Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI) , year =

  49. [57]

    Social Choice and Welfare , year =

    Peters, Jannik , title =. Social Choice and Welfare , year =

  50. [58]

    2024 , edition =

    Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division , publisher =. 2024 , edition =

    2024

  51. [59]

    Pacific Journal of Mathematics , year =

    Sion, Maurice , title =. Pacific Journal of Mathematics , year =

  52. [60]

    ACM SIGecom Exchanges , volume =

    Suksompong, Warut , title =. ACM SIGecom Exchanges , volume =. 2021 , pages =

    2021

  53. [61]

    Information Processing Letters , volume =

    Suksompong, Warut , title =. Information Processing Letters , volume =. 2025 , pages =

    2025

  54. [62]

    European Journal of Operational Research , volume =

    Sun, Ankang and Chen, Bo , title =. European Journal of Operational Research , volume =. 2025 , pages =

    2025

  55. [63]

    Proceedings of the 25th ACM Conference on Economics and Computation (EC) , year =

    Suzuki, Mashbat and Vollen, Jeremy , title =. Proceedings of the 25th ACM Conference on Economics and Computation (EC) , year =

  56. [64]

    Artificial Intelligence , volume =

    Wu, Xiaowei and Zhang, Cong and Zhou, Shengwei , title =. Artificial Intelligence , volume =. 2025 , pages =

    2025

  57. [65]

    Journal of Economic Theory , volume=

    On a conjecture by Gale about one-sided matching problems , author=. Journal of Economic Theory , volume=

Pith tools

Reviewed July 14, 2026 · model on record in the stance chip above.