We present in this paper an incentive-compatible distributed optimization method applied to social choice problems. The method works by computing and collecting VCG taxes in a distributed fashion. This introduces a certain resilience to manipulation from the problem solving agents. An extension of this method sacrifices Pareto-optimality in favor of budget-balance: the solutions chosen are not optimal anymore, but the advantage is that the self interested agents pay the taxes between themselves, thus producing no tax surplus. This eliminates unwanted incentives for the problem solving agents, ensuring their faithfulness. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Petcu, A., & Faltings, B. (2005). Incentive compatible multiagent constraint optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3828 LNCS, pp. 708–717). https://doi.org/10.1007/11600930_71
Mendeley helps you to discover research relevant for your work.