scientific article; zbMATH DE number 7359385
From MaRDI portal
Publication:4993317
DOI10.4230/LIPIcs.ITCS.2018.48zbMath1462.68160arXiv1702.08533MaRDI QIDQ4993317
Zhiwei Steven Wu, Aleksandrs Slivkins, Yishay Mansour
Publication date: 15 June 2021
Full work available at URL: https://arxiv.org/abs/1702.08533
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Rationality and learning in game theory (91A26) Probabilistic games; gambling (91A60)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The impact of competition on prices with numerous firms
- The \(K\)-armed dueling bandits problem
- Asymptotically efficient adaptive allocation rules
- Information, trade and common knowledge
- Truthful Mechanisms with Implicit Payment Computation
- Learning and incentives in user-generated content
- Multi‐Armed Bandit Allocation Indices
- Equilibrium with Product Differentiation
- Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems
- The Dynamic Pivot Mechanism
- Strategic Experimentation
- Perfect Competition in Markets With Adverse Selection
- The Nonstochastic Multiarmed Bandit Problem
- Product Design in Selection Markets *
- Optimal Dynamic Mechanism Design and the Virtual-Pivot Mechanism
- Strategic Experimentation with Exponential Bandits
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- An Efficient Dynamic Mechanism
- Characterizing Truthful Multi-armed Bandit Mechanisms
- Dueling algorithms
- Probability and Computing
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication:
