We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic age...
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
In this paper, a generic optimization problem arising in supply chain design is modeled in a game theoretic framework and solved as a decentralized problem using a mechanism desig...
Learning Classifier Systems (LCSs), such as the accuracy-based XCS, evolve distributed problem solutions represented by a population of rules. During evolution, features are speci...
Martin V. Butz, Martin Pelikan, Xavier Llorà...