The utilitarian solution criterion, which has been extensively studied in multi-agent decision making under uncertainty, aims to maximize the sum of individual utilities. However, as the utilitarian solution often discriminates against some agents, it is not desirable for many practical applications where agents have their own interests and fairness is expected. To address this issue, this paper introduces egalitarian solution criteria for sequential decision-making under uncertainty, which are based on the maximin principle. Motivated by different application domains, we propose four maximin fairness criteria and develop corresponding algorithms for computing their optimal policies. Furthermore, we analyze the connections between these cri...
The efficient use of resources is a crucial problem of our time. Besides the constraints of efficien...
We study the computational complexity of computing allocations that are both fair and maximize the u...
We study the problem of fair allocation of M indivisible items among N agents using the popular noti...
The utilitarian solution criterion, which has been extensively studied in multi-agent decision makin...
We define a fairness solution criterion for multi-agent decision-making problems, where agents have ...
Multi-agent systems are complex systems in which multiple autonomous entities, called agents, cooper...
The problem of multi-agent resource allocation is important and well-studied within AI and economics...
I analyze an economy with uncertainty in which a set of indivisible objects and a certain amount of ...
In this paper we study resource allocation problems that involve multiple self-interested parties or...
In the field of multiagent systems, one important problem is fairly allocating items among a set of ...
We study the problem of allocating indivisible goods among n agents in a fair manner. For this probl...
I analyze an economy with uncertainty in which a set of indivisible objects and a certain amount of ...
International audienceThis paper raises the question of collective decision making under possibilist...
This thesis theoretically studies fairness, efficiency, and strategyproofness, in the model of assig...
The first chapter is based on a paper with Jin Li in fair division. It was recently discovered that ...
The efficient use of resources is a crucial problem of our time. Besides the constraints of efficien...
We study the computational complexity of computing allocations that are both fair and maximize the u...
We study the problem of fair allocation of M indivisible items among N agents using the popular noti...
The utilitarian solution criterion, which has been extensively studied in multi-agent decision makin...
We define a fairness solution criterion for multi-agent decision-making problems, where agents have ...
Multi-agent systems are complex systems in which multiple autonomous entities, called agents, cooper...
The problem of multi-agent resource allocation is important and well-studied within AI and economics...
I analyze an economy with uncertainty in which a set of indivisible objects and a certain amount of ...
In this paper we study resource allocation problems that involve multiple self-interested parties or...
In the field of multiagent systems, one important problem is fairly allocating items among a set of ...
We study the problem of allocating indivisible goods among n agents in a fair manner. For this probl...
I analyze an economy with uncertainty in which a set of indivisible objects and a certain amount of ...
International audienceThis paper raises the question of collective decision making under possibilist...
This thesis theoretically studies fairness, efficiency, and strategyproofness, in the model of assig...
The first chapter is based on a paper with Jin Li in fair division. It was recently discovered that ...
The efficient use of resources is a crucial problem of our time. Besides the constraints of efficien...
We study the computational complexity of computing allocations that are both fair and maximize the u...
We study the problem of fair allocation of M indivisible items among N agents using the popular noti...