Motivated by governance models adopted in blockchain applications, we study the problem of selecting appropriate system updates in a decentralized way. Contrary to most existing voting approaches, we use the input of a set of motivated experts of varying levels of expertise. In particular, we develop an approval voting inspired selection mechanism through which the experts approve or disapprove the different updates according to their perception of the quality of each alternative. Given their opinions, and weighted by their expertise level, a single update is then implemented and evaluated, and the experts receive rewards based on their choices. We show that this mechanism always has approximate pure Nash equilibria and that these achieve a constant factor approximation with respect to the quality benchmark of the optimal alternative. Finally, we study the repeated version of the problem, where the weights of the experts are adjusted after each update, according to their performance. Under mild assumptions about the weights, the extension of our mechanism still has approximate pure Nash equilibria in this setting.

Decentralized Update Selection with Semi-strategic Experts / Amanatidis, G.; Birmpas, G.; Lazos, P.; Marmolejo-Cossio, F.. - 13584:(2022), pp. 403-420. ( 15th International Symposium on Algorithmic Game Theory, SAGT 2022 Colchester ) [10.1007/978-3-031-15714-1_23].

Decentralized Update Selection with Semi-strategic Experts

Amanatidis G.
;
Birmpas G.
;
2022

Abstract

Motivated by governance models adopted in blockchain applications, we study the problem of selecting appropriate system updates in a decentralized way. Contrary to most existing voting approaches, we use the input of a set of motivated experts of varying levels of expertise. In particular, we develop an approval voting inspired selection mechanism through which the experts approve or disapprove the different updates according to their perception of the quality of each alternative. Given their opinions, and weighted by their expertise level, a single update is then implemented and evaluated, and the experts receive rewards based on their choices. We show that this mechanism always has approximate pure Nash equilibria and that these achieve a constant factor approximation with respect to the quality benchmark of the optimal alternative. Finally, we study the repeated version of the problem, where the weights of the experts are adjusted after each update, according to their performance. Under mild assumptions about the weights, the extension of our mechanism still has approximate pure Nash equilibria in this setting.
2022
15th International Symposium on Algorithmic Game Theory, SAGT 2022
Voting; Decentralized; Nash equilibria
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Decentralized Update Selection with Semi-strategic Experts / Amanatidis, G.; Birmpas, G.; Lazos, P.; Marmolejo-Cossio, F.. - 13584:(2022), pp. 403-420. ( 15th International Symposium on Algorithmic Game Theory, SAGT 2022 Colchester ) [10.1007/978-3-031-15714-1_23].
File allegati a questo prodotto
File Dimensione Formato  
Amanaditis_preprint_Decentralized-Update_2022.pdf

accesso aperto

Note: https://link.springer.com/chapter/10.1007/978-3-031-15714-1_23
Tipologia: Documento in Pre-print (manoscritto inviato all'editore, precedente alla peer review)
Licenza: Creative commons
Dimensione 251.59 kB
Formato Adobe PDF
251.59 kB Adobe PDF
Amanaditis_Decentralized-Update_2022.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 21.53 MB
Formato Adobe PDF
21.53 MB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1685513
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact