While there has been some work on the behavior of no-regret dynamics in auctions [1]}, [2]}, [3]}, we do not know of previous analysis
of the average utilities and revenue of standard regret-minimization dynamics in standard auction formats. The closest paper conceptually to ours is [1]} that
manages to analyze these for no-regret dynamics that are preceded by a long pure exploration
phase by all agents.
Here we
provide theoretical analysis
and simulations for standard regret-minimization algorithms (without a pre-exploration phase),
sometimes getting very different results.
<FIGURE>