paper-with-me

Papers

Repeated Auctions with Speculators: Arbitrage Incentives and Forks in DAOs

2025-05-27 · Nicolas Eschenbaum, Nicolas Greber

We analyze the vulnerability of decentralized autonomous organizations (DAOs) to speculative exploitation via their redemption mechanisms. Studying a game-theoretic model of repeated auctions for governance shares with speculators, we characterize the conditions under which -- in equilibrium -- an exploitative exit is guaranteed to occur, occurs in expectation, or never occurs. We evaluate four redemption mechanisms and extend our model to include atomic exits, time delays, and DAO spending strategies. Our results highlight an inherent tension in DAO design: mechanisms intended to protect members from majority attacks can inadvertently create opportunities for costly speculative exploitation. We highlight governance mechanisms that can be used to prevent speculation.

📄 PDF Abstract BibTeX arXiv:2505.21296

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Auctions Between Regret-Minimizing Agents

2021-10-22 · Yoav Kolumbus, Noam Nisan

We analyze a scenario in which software agents implemented as regret-minimizing algorithms engage in a repeated auction on behalf of their users. We study first-price and second-price auctions, as well as their generaliz…

Coordinated Dynamic Bidding in Repeated Second-Price Auctions with Budgets

2023-06-13 · Yurong Chen, Qian Wang, Zhijian Duan, Haoran Sun 외

In online ad markets, a rising number of advertisers are employing bidding agencies to participate in ad auctions. These agencies are specialized in designing online algorithms and bidding on behalf of their clients. Typ…

A Game-Theoretic Analysis of the Empirical Revenue Maximization Algorithm with Endogenous Sampling

2020-10-12 · NeurIPS 2020 12 · Xiaotie Deng, Ron Lavi, Tao Lin, Qi Qi 외

The Empirical Revenue Maximization (ERM) is one of the most important price learning algorithms in auction design: as the literature shows it can learn approximately optimal reserve prices for revenue-maximizing auctione…

Tacit Bidder-Side Collusion: Artificial Intelligence in Dynamic Auctions

2025-11-26 · Sriram Tolety arxiv

We study whether large language models acting as autonomous bidders can tacitly collude by coordinating when to accept platform posted payouts in repeated Dutch auctions, without any communication. We present a minimal r…

Loss-Versus-Fair: Efficiency of Dutch Auctions on Blockchains

2024-05-31 · Ciamac C. Moallemi, Dan Robinson

Milionis et al.(2023) studied the rate at which automated market makers leak value to arbitrageurs when block times are discrete and follow a Poisson process, and where the risky asset price follows a geometric Brownian …