In three contributions, we address the topic of optimal bidding strategies and auction design. First, we study truthful bidding in online display ad auctions and find that bidders with a typical value model often have only little incentive to deviate from truthful bidding. On average truthful bidding results in high market efficiency. We then develop and propose a combinatorial auction design for renewable energy auctions that leads to an efficient allocation, allows bidders to communicate synergies, and leads to linear and near anonymous prices. Finally, we develop an algorithm, based on policy networks, that learns approximate Bayes-Nash equilibrium strategies in auction games.
«
In three contributions, we address the topic of optimal bidding strategies and auction design. First, we study truthful bidding in online display ad auctions and find that bidders with a typical value model often have only little incentive to deviate from truthful bidding. On average truthful bidding results in high market efficiency. We then develop and propose a combinatorial auction design for renewable energy auctions that leads to an efficient allocation, allows bidders to communicate syner...
»