4 citations · 4 across the 1 of their papers we have counts for
3 papers
cs.GT2025
Existence of Fair and Efficient Allocation of Indivisible Chores
Ryoga Mahara
We study the problem of allocating indivisible chores among agents with additive cost functions in a fair and efficient manner. A major open question in this area is whether there…
cs.GT2024
A Polynomial-Time Algorithm for Fair and Efficient Allocation with a Fixed Number of Agents
Ryoga Mahara
We study the problem of fairly and efficiently allocating indivisible goods among agents with additive valuation functions. Envy-freeness up to one good (EF1) is a well-studied fai…
cs.GT2021★ 4 cited
Extension of Additive Valuations to General Valuations on the Existence of EFX
Ryoga Mahara
Envy-freeness is one of the most widely studied notions in fair division. Since envy-free allocations do not always exist when items are indivisible, several relaxations have been…