Skip to main navigation Skip to search Skip to main content

Bribeproof Mechanisms for Two-Values Domains

  • Matús Mihalák
  • , Paolo Penna*
  • , Peter Widmayer
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Abstract

Schummer [27] introduced the concept of bribeproof mechanism which, in a context where monetary transfer between agents is possible, requires that manipulations through bribes are ruled out. Unfortunately, in many domains, the only bribeproof mechanisms are the trivial ones which return a fixed outcome.this work presents one of the few constructions of non-trivial bribeproof mechanisms for this setting. Though the suggested construction applies to rather restricted domains, the results obtained are tight: for several natural problems, the method yields the only possible bribeproof mechanism and no such mechanism is possible on more general domains.
Original languageEnglish
Title of host publicationAlgorithmic Game Theory - 9th International Symposium, SAGT 2016, Proceedings
EditorsMartin Gairing, Rahul Savani
PublisherSpringer
Pages289-301
Number of pages13
ISBN (Electronic)9783662533543
ISBN (Print)9783662533536
DOIs
Publication statusPublished - 2016

Publication series

SeriesLecture Notes in Computer Science
Volume9928

Fingerprint

Dive into the research topics of 'Bribeproof Mechanisms for Two-Values Domains'. Together they form a unique fingerprint.

Cite this