activity
20242026
collaborators

6 papers

cs.GT2026

Fair and Efficient Balanced Allocation for Indivisible Goods

Yasushi Kawase, Ryoga Mahara

We study the problem of allocating indivisible goods among agents with additive valuation functions to achieve both fairness and efficiency under the constraint that each agent rec…

cs.GT2026

The Power of Share-Based Notions in Proving Envy-Based Fairness Guarantees

Hannaneh Akrami, Uriel Feige, Ryoga Mahara +2

We study the problem of fairly allocating indivisible goods among agents with monotone valuations. We introduce a new share-based fairness notion, the residual maximin share (RMMS)…

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.GT2025

Position Fair Mechanisms Allocating Indivisible Goods

Ryoga Mahara, Ryuhei Mizutani, Taihei Oki +1

Fair division mechanisms for indivisible goods require agent orderings to deterministically select one allocation when running the algorithm in practice. We introduce position envy…

cs.GT2025

Existence of EFX for Two Additive Valuations

Ryoga Mahara

Fair division of indivisible items is a well-studied topic in Economics and Computer Science. The objective is to allocate items to agents in a fair manner, where each agent has a…

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…