This paper attends to the problem of a mechanism designer seeking to influence the outcome of a strategic game based on her creditability. The mechanism designer offers additional payments to the players depending on their mutual choice of strategies in order to steer them to certain decisions. Of course, the mechanism designer aims at spending as little as possible and yet implementing her desired outcome. We present several algorithms for this optimization problem both for singleton target strategy profiles and target strategy profile regions. Furthermore, the paper shows how a bankrupt mechanism designer can decide efficiently whether strategy profiles can be implemented at no cost at all. Finally, risk-averse players and dynamic games are examined. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Eidenbenz, R., Oswald, Y. A., Schmid, S., & Wattenhofer, R. (2007). Mechanism design by creditability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4616 LNCS, pp. 208–219). Springer Verlag. https://doi.org/10.1007/978-3-540-73556-4_24
Mendeley helps you to discover research relevant for your work.