Antoine Nongaillard

  • Citations Per Year
Learn More
The multi-agent resource allocation problem is the negotiation of a set of resources among a population of agents, in order to maximize a social welfare function. The purpose of this study is the definition of the agent behavior which leads, if possible, to an optimal resource allocation at the end of the negotiation process as an emergent phenomenon. This(More)
The multi-agent resource allocation problem is the negotiation of m resources among the n agents of a population, in order to maximize a social welfare function. Contrary to some former studies, the purpose is here neither to simply determine a socially optimal resource allocation nor to prove the existence of a transaction sequence leading to this optimum.(More)
The allocation of m resources between n agents is an AI problem with a great practical interest for automated trading. The general question is how to configure the behavior of bargaining agents to induce a socially optimal allocation. The literature contains many proposals for calculating a social welfare but the Nash welfare seems to be the one which has(More)
The multi-agent resource allocation problem corresponds to the negotiation of m resources among n autonomous agents in order to maximize a social welfare. Contrary to some former studies, the purpose is neither here to simply determine a socially optimal resource allocation nor to prove the existence of a transaction sequence leading to this optimum, but to(More)
The multi-agent resource allocation problem corresponds to the negotiation of m resources among n autonomous agents, in order to maximize a social welfare function. Contrary to some former studies, the purpose is neither here to simply determine a socially optimal resource allocation nor to prove the existence of a transaction sequence leading to this(More)
Automated mechanism design (AMD) seeks to find, using algorithms, the optimal rules of interaction (a mechanism) between selfish and rational agents in order to get the best outcome. Here optimal is defined by the objective function of the designer of the mechanism where the function has usually some desirable properties (e.g., Pareto optimal). A difficulty(More)
This study seeks to provide scalable and distributed algorithms to solve the resource allocation problem within an agent community. We propose an approach that can be applied to any kind of contact network, any range for the utility values, for the most important social welfare notions, avoiding the centralized approach drawbacks. In that purpose, we study(More)