4 citations · 9 across the 8 of their papers we have counts for
11 papers
A Matroid Generalization of Weighted Popular Matching: Characterization and Algorithm
Yuni Iwamasa, Yusuke Kobayashi, Ryoga Mahara +1
We study a problem that unifies two major generalizations of popular matchings in the one-sided preference model. In a bipartite graph in which each vertex, or applicant, on one si…
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…
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)…
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…
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…
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…
EFX Allocations for Indivisible Chores: Matching-Based Approach
Yusuke Kobayashi, Ryoga Mahara, Souta Sakamoto
One of the most important topics in discrete fair division is whether an EFX allocation exists for any instance. Although the existence of EFX allocations is a standing open proble…
Reconfiguration of the Union of Arborescences
Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz
An arborescence in a digraph is an acyclic arc subset in which every vertex execpt a root has exactly one incoming arc. In this paper, we reveal the reconfigurability of the union…
Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average
Yusuke Kobayashi, Ryoga Mahara
We study the problem of fairly allocating a set of indivisible goods to multiple agents and focus on the proportionality, which is one of the classical fairness notions. Since prop…
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…
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…