Julien Lesca

Learn More
Reallocating resources to get mutually beneficial outcomes is a fundamental problem in various multi-agent settings. In the first part of the paper we focus on the setting in which agents express additive cardinal utilities over objects. We present computational hardness results as well as polynomial-time algorithms for testing Pareto optimality under(More)
Core-selection is a crucial property of social choice functions, or rules, in social choice literature. It is also desirable to address the incentive of agents to cheat by misreporting their preferences. This paper investigates an exchange problem where each agent may have multiple indivisible goods, agents’ preferences over sets of goods are assumed to be(More)
Multiobjective Dynamic Programming (MODP) is a general problem solving method used to determine the set of Pareto-optimal solutions in optimization problems involving discrete decision variables and multiple objectives. It applies to combinatorial problems in which Pareto-optimality of a solution extends to all its sub-solutions (Bellman principle). In this(More)
We address here the problem of minimizing Choquet Integrals (also known as ‘‘Lovász Extensions’’) over solution sets which can be either polyhedra or (mixed) integer sets. Typical applications of such problems concern the search of compromise solutions in multicriteria optimization. We focus here on the case where the Choquet Integrals to be minimized are(More)
The class of Groves mechanisms has been attracting much attention in mechanism design literature due to two attractive characteristics: utilitarian efficiency (also called social welfare maximization) and dominant strategy incentive compatibility. However, when strategic agents can create multiple fake identities and reveal more than one preference under(More)
This article deals with the allocation of objects where each agent receives a single item. Starting from an initial endowment, the agents can be better off by exchanging their objects. However, not all trades are likely because some participants are unable to communicate. By considering that the agents are embedded in a social network, we propose to study(More)