In this paper, we address the problem of determining an envy-free allocation of indivisible goods among multiple agents. EFX, which stands for envy-free up to any good, is a well-studied problem that has been shown to exist for specific scenarios, such as when there are only three agents with MMS valuations, as demonstrated by Chaudhury et al(2020), and for any number of agents when there are only two types of valuations as shown by Mahara(2020). Our contribution is to extend these results by showing that EFX exists for four agents with three distinct valuations. We further generalize this to show the existance of EFX allocations for n agents when n-2 of them have identical valuations
We study the problem of fairly allocating indivisible goods between groups of agents using the recen...
We study the problem of fairly and efficiently allocating indivisible chores among agents with addit...
We study the problem of fair division when the resources contain both divisible and indivisible good...
Fair division of indivisible items is a well-studied topic in Economics and Computer Science.The obj...
The existence of EFX allocations is a fundamental open problem in discretefair division. Given a set...
We consider the classic problem of fairly allocating indivisible goods among agents with additive va...
We study the problem of fairly allocating a set of $m$ indivisible goods to aset of $n$ agents. Envy...
We consider the classic problem of fairly allocating indivisible goods among agents with additive va...
We study the problem of fairly allocating a multiset $M$ of $m$ indivisible items among $n$ agents w...
We consider the problem of sharing a set of indivisible goods among agents in a fair manner, namely ...
We consider the problem of allocating indivisible goods among $n$ agents in a fair manner. For this ...
Fair division of indivisible goods is a very well-studied problem. The goal of this problem is to di...
The fair division of indivisible goods is a very well-studied problem. The goal of this problem is t...
We study the problem of fairly allocating indivisible goods between groups of agents using the recen...
We study the problem of fairly allocating a set of indivisible goods among $n$ agents with additive ...
We study the problem of fairly allocating indivisible goods between groups of agents using the recen...
We study the problem of fairly and efficiently allocating indivisible chores among agents with addit...
We study the problem of fair division when the resources contain both divisible and indivisible good...
Fair division of indivisible items is a well-studied topic in Economics and Computer Science.The obj...
The existence of EFX allocations is a fundamental open problem in discretefair division. Given a set...
We consider the classic problem of fairly allocating indivisible goods among agents with additive va...
We study the problem of fairly allocating a set of $m$ indivisible goods to aset of $n$ agents. Envy...
We consider the classic problem of fairly allocating indivisible goods among agents with additive va...
We study the problem of fairly allocating a multiset $M$ of $m$ indivisible items among $n$ agents w...
We consider the problem of sharing a set of indivisible goods among agents in a fair manner, namely ...
We consider the problem of allocating indivisible goods among $n$ agents in a fair manner. For this ...
Fair division of indivisible goods is a very well-studied problem. The goal of this problem is to di...
The fair division of indivisible goods is a very well-studied problem. The goal of this problem is t...
We study the problem of fairly allocating indivisible goods between groups of agents using the recen...
We study the problem of fairly allocating a set of indivisible goods among $n$ agents with additive ...
We study the problem of fairly allocating indivisible goods between groups of agents using the recen...
We study the problem of fairly and efficiently allocating indivisible chores among agents with addit...
We study the problem of fair division when the resources contain both divisible and indivisible good...