Artificial Intelligence and Image Processing
Springer Nature - SN SciGraph project
978-3-540-22849-3
978-3-540-27836-8
Automata, Languages and Programming
Vincenzo
Auletta
https://scigraph.springernature.com/explorer/license/
https://link.springer.com/10.1007%2F978-3-540-27836-8_17
chapters
chapter
en
We study combinatorial optimization problems involving one-parameter selfish agents considered by Archer and Tardos [FOCS 2001]. In particular, we show that, if agents can lie in one direction (that is they either overbid or underbid) then any (polynomial-time) c-approximation algorithm, for the optimization problem without selfish agents, can be turned into a (polynomial-time) c(1+ε)-approximation truthful mechanism, for any ε >0. We then look at the Q||C max problem in the case of agents owning machines of different speeds. We consider the model in which payments are given to the agents only after the machines have completed the jobs assigned. This means that for each machine that receives at least one job, the mechanism can verify if the corresponding agent declared a greater speed. For this setting, we characterize the allocation algorithms A that admit a payment function P such that M=(A,P) is a truthful mechanism. In addition, we give a (1+ε)-approximation truthful mechanism for Q||C max when machine speeds are bounded by a constant. Finally, we consider the classical scheduling problem Q|| ∑ wj Cj which does not admit an exact mechanism if verification is not allowed. By contrast, we show that an exact mechanism for Q|| ∑ wj Cj exists when verification is allowed.
true
2004-01-01
2019-04-16T08:21
171-182
2004
The Power of Verification for One-Parameter Agents
Lepistö
Arto
pub.1023831388
dimensions_id
Springer Berlin Heidelberg
Berlin, Heidelberg
Persiano
Giuseppe
De Prisco
Roberto
readcube_id
71893f4f39f8c704dea6387c7ebf13a5f22987da275405e8e3ce6d886c29eb7a
Díaz
Josep
Sannella
Donald
Paolo
Penna
10.1007/978-3-540-27836-8_17
doi
Dipartimento di Informatica ed Applicazioni “R.M. Capocelli”, Università di Salerno, via S. Allende 2, I-84081, Baronissi, (SA), Italy
University of Salerno
Information and Computing Sciences
Juhani
Karhumäki