Characterizing Truthful Multi-armed Bandit Mechanisms

DOI10.1137/120878768zbMath1308.91061arXiv0812.2291OpenAlexW2116821104MaRDI QIDQ5419036

Moshe Babaioff, Aleksandrs Slivkins, Yogeshwer Sharma

Publication date: 4 June 2014

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0812.2291

zbMATH Keywords

regretalgorithmic mechanism designmulti-armed banditstruthful mechanismspay-per-click auctionssingle-parameter auctions

Mathematics Subject Classification ID

Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) (n)-person games, (n>2) (91A06) Auctions, bargaining, bidding and selling, and other market models (91B26) Probabilistic games; gambling (91A60) Online algorithms; streaming algorithms (68W27)

Related Items (9)

Bayesian Exploration: Incentivizing Exploration in Bayesian Games ⋮ Maximizing revenue for publishers using header bidding and ad exchange auctions ⋮ Repeated budgeted second price ad auction ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An optimal bidimensional multi-armed bandit auction for multi-unit procurement ⋮ Truthful Mechanisms with Implicit Payment Computation ⋮ Bayesian Incentive-Compatible Bandit Exploration ⋮ Learning in Repeated Auctions

This page was built for publication: Characterizing Truthful Multi-armed Bandit Mechanisms