scholar.google.com › citations
Jan 23, 2014 · Truthful mechanisms using optimal algorithms is the tool the research has devised to solve optimization problems in their wholeness. In general, ...
Original language, English. Pages (from-to), 64-79. Number of pages, 16. Journal, Theoretical Computer Science. Volume, 518. DOIs.
Original language, English. Pages (from-to), 64-79. Number of pages, 16. Journal, Theoretical Computer Science. Volume, 518. DOIs.
TL;DR: This work characterize the minimal set of verification assumptions needed for the truthfulness of optimal algorithms, for both social cost and max cost ...
ABSTRACT. In this paper we investigate the problem of designing load balancing protocols in distributed systems involving self-interested participants.
We study the question of whether optimization problems can be solved exactly in the presence of economic constraints, such as truthfulness of selfish agents ...
Nov 29, 2014 · Our approach involves three steps: (i) specifying the structure of mechanisms, (ii) constructing a verification algorithm, and (iii) measuring ...
Missing: optimization | Show results with:optimization
We aim at identifying a minimal set of conditions under which algorithms with good approximation guarantees are truthful without money. In line with recent ...
Mar 14, 2024 · In this paper we study optimization problems with verifiable one-parameter selfish agents introduced by Auletta et al.
Our approach involves three steps: (i) specifying the structure of mech- anisms, (ii) constructing a verification algorithm, and (iii) measuring the quality of ...
Missing: optimization | Show results with:optimization