We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...
When writing a constraint program, we have to decide what to make the decision variable, and how to represent the constraints on these variables. In many cases, there is considerab...
CoMex (Coordination Mechanism) is a system to coordinate the execution of tasks accessing coordinable entities. It uses coordination rules to describe the temporal and logical orde...
Scheduling problems overall assume that it is possible to identify stable criteria definitions measuring the quality of alternatives. In real world problems however, this does not ...
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...