Computer Science – Computer Science and Game Theory
Scientific paper
2010-01-26
Computer Science
Computer Science and Game Theory
Scientific paper
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experience with items that are auctioned repeatedly over an infinite horizon. A central question here is understanding what natural restrictions on the environment permit the design of optimal mechanisms (note that even in the simpler static setting, optimal mechanisms are characterized only under certain restrictions). We provide a {\em structural characterization} of a natural "separable: multi-armed bandit environment (where the evolution and incentive structure of the a-priori type is decoupled from the subsequent experience in a precise sense) where dynamic optimal mechanism design is possible. Here, we present the Virtual Index Mechanism, an optimal dynamic mechanism, which maximizes the (long term) {\em virtual surplus} using the classical Gittins algorithm. The mechanism optimally balances exploration and exploitation, taking incentives into account.
Kakade Sham M.
Lobel Ilan
Nazerzadeh Hamid
No associations
LandOfFree
An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-644131