Randomized truthful auctions can restore truthful bidding by learning agents and strictly outperform second-price auctions with reserves, with auctioneer regret roughly T^(3/4) for fixed auctions and roughly sqrt(T) for scheduled ones.
In order to show our result, we utilize a characterization (c f
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Randomized Truthful Auctions with Learning Agents
Randomized truthful auctions can restore truthful bidding by learning agents and strictly outperform second-price auctions with reserves, with auctioneer regret roughly T^(3/4) for fixed auctions and roughly sqrt(T) for scheduled ones.