Publications by Adrian Petcu | EPFL Graph Search

Related publications (6)

M-DPOP: Faithful distributed implementation of efficient social choice problems

In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agents, where each agent has private information about its utility function. In th ...

2008

A class of algorithms for distributed constraint optimization

Adrian Petcu

Multi Agent Systems (MAS) have recently attracted a lot of interest because of their ability to model many real life scenarios where information and control are distributed among a set of different agents. Practical applications include planning, schedulin ...

EPFL2007

Distributed Constraint Optimization with Structured Resource Constraints

Boi Faltings, Adrian Petcu

Distributed constraint optimization (DCOP) provides a framework for coordinated decision making by a team of agents. Often, during the decision making, capacity constraints on agents' resource consumption must be taken into account. To address such scenari ...

2009

Method to allocate inter-dependent resources by a set of participants

Boi Faltings, Adrian Petcu, Thomas Léauté

The object of the present invention is a method that allows a group of independent participants to coordinate decisions with respect to the allocation of interdependent resources, while maintaining certain privacy guarantees. The present invention proposes ...

2009

Method to allocate inter-dependent resources by a set of participants

Boi Faltings, Adrian Petcu, Thomas Léauté

The object of the present invention is a method that allows a group of independent participants to coordinate decisions with respect to the allocation of interdependent resources, while maintaining certain privacy guarantees. The present invention proposes ...

2009

Privacy Guarantees through Distributed Constraint Satisfaction

Boi Faltings, Adrian Petcu, Thomas Léauté

The reason for using distributed constraint satisfaction algorithms is often to allow agents to find a solution while revealing as little as possible about their variables and constraints. So far, most algorithms for DisCSP do not guarantee privacy of this ...

2008