Learning and collusion in multi-unit auctions
S Brânzei, M Derakhshan… - Advances in Neural …, 2023 - proceedings.neurips.cc
In a carbon auction, licenses for CO2 emissions are allocated among multiple interested
players. Inspired by this setting, we consider repeated multi-unit auctions with uniform …
players. Inspired by this setting, we consider repeated multi-unit auctions with uniform …
Tight revenue gaps among simple mechanisms
We consider a fundamental problem in microeconomics: selling a single item to a number of
potential buyers, whose values are drawn from known independent and regular (not …
potential buyers, whose values are drawn from known independent and regular (not …
Bidding in Uniform Price Auctions for Value Maximizing Buyers
N Golrezaei, S Sahoo - arXiv preprint arXiv:2406.03674, 2024 - arxiv.org
We study the problem of bidding in uniform price auctions widely used in practice. Although
these auctions are non-truthful for bidders with quasilinear utility functions, several empirical …
these auctions are non-truthful for bidders with quasilinear utility functions, several empirical …
[图书][B] Online Learning in Multi-unit Auctions
We consider repeated multi-unit auctions with uniform pricing, which are widely used in
practice for allocating goods such as carbon licenses. In each round, K identical units of a …
practice for allocating goods such as carbon licenses. In each round, K identical units of a …
Towards a characterization of worst case equilibria in the discriminatory price auction
We study the performance of the discriminatory price auction under the uniform bidding
interface, which is one of the popular formats for running multi-unit auctions in practice. We …
interface, which is one of the popular formats for running multi-unit auctions in practice. We …
讨价还价博弈均衡出价策略的算法设%.
徐齐利 - Journal of Computer Engineering & Applications, 2020 - search.ebscohost.com
在商业智能领域, 为求解买卖双方讨价还价博弈的均衡出价策略, 在逆向归纳法的基础上,
开发出两个高效且实用的算法: 基于逆向归纳过程, 设计出迭代算法; 基于逆向归纳结果 …
开发出两个高效且实用的算法: 基于逆向归纳过程, 设计出迭代算法; 基于逆向归纳结果 …
Tight revenue gaps among simple and optimal mechanisms
Consider a fundamental problem in microeconomics: selling a single item to a number of
potential buyers, who independently draw their values from regular and publicly known …
potential buyers, who independently draw their values from regular and publicly known …
[图书][B] How Close Does It Get? From Near-Optimal Network Algorithms to Suboptimal Equilibrium Outcomes
R Brokkelkamp - 2022 - eprints.illc.uva.nl
The five chapters in this thesis are connected by the following question: How Close Does It
Get? In Chapter 3, we study two pricing problems in networks. We are given a directed …
Get? In Chapter 3, we study two pricing problems in networks. We are given a directed …
Corruption in Auctions: Social Welfare Loss in Hybrid Multi-Unit Auctions
A van Beek, R Brokkelkamp, G Schäfer - arXiv preprint arXiv:2106.01822, 2021 - arxiv.org
We initiate the study of the social welfare loss caused by corrupt auctioneers, both in single-
item and multi-unit auctions. In our model, the auctioneer may collude with the winning …
item and multi-unit auctions. In our model, the auctioneer may collude with the winning …
[PDF][PDF] MULTI-UNIT AUCTIONS
A TSIKIRIDIS - 2017 - artemtsikiridis.com
In this thesis we study the existence and (in) efficiency of Nash equilibria in multi-unit
auctions, where an auctioneer is opting to sell several copies of a single indivisible good to …
auctions, where an auctioneer is opting to sell several copies of a single indivisible good to …