English
Related papers

Related papers: Robust double auction mechanisms

200 papers

We present an approach, based on deep neural networks, that allows identifying robust statistical arbitrage strategies in financial markets. Robust statistical arbitrage strategies refer to trading strategies that enable profitable trading…

Computational Finance · Quantitative Finance 2024-02-27 Ariel Neufeld , Julian Sester , Daiying Yin

Auctions via social network, pioneered by Li et al. (2017), have been attracting considerable attention in the literature of mechanism design for auctions. However, no known mechanism has satisfied strategy-proofness, non-deficit,…

Computer Science and Game Theory · Computer Science 2019-11-21 Takehiro Kawasaki , Nathanael Barrot , Seiji Takanashi , Taiki Todo , Makoto Yokoo

We investigate approximately optimal mechanisms in settings where bidders' utility functions are non-linear; specifically, convex, with respect to payments (such settings arise, for instance, in procurement auctions for energy). We provide…

Computer Science and Game Theory · Computer Science 2017-02-23 Amy Greenwald , Takehiro Oyakawa , Vasilis Syrgkanis

The growing demand for data and AI-generated digital goods, such as personalized written content and artwork, necessitates effective pricing and feedback mechanisms that account for uncertain utility and costly production. Motivated by…

Computer Science and Game Theory · Computer Science 2023-06-06 Zachary Robertson , Oluwasanmi Koyejo

Optimal mechanisms have been provided in quite general multi-item settings, as long as each bidder's type distribution is given explicitly by listing every type in the support along with its associated probability. In the implicit setting,…

Computer Science and Game Theory · Computer Science 2015-03-09 Constantinos Daskalakis , Alan Deckelbaum , Christos Tzamos

Auctions are important mechanisms extensively implemented in various markets, e.g., search engines' keyword auctions, antique auctions, etc. Finding an optimal auction mechanism is extremely difficult due to the constraints of imperfect…

Machine Learning · Computer Science 2025-07-28 Jiayin Liu , Chenglong Zhang

A seller is selling a pair of divisible complementary goods to an agent. The agent consumes the goods only in a specific ratio and freely disposes of excess in either goods. The value of the bundle and the ratio are private information of…

Theoretical Economics · Economics 2022-07-15 Komal Malik , Kolagani Paramahamsa

A large fraction of online advertisement is sold via repeated second price auctions. In these auctions, the reserve price is the main tool for the auctioneer to boost revenues. In this work, we investigate the following question: Can…

Computer Science and Game Theory · Computer Science 2020-02-19 Yash Kanoria , Hamid Nazerzadeh

In this study, we apply reinforcement learning techniques and propose what we call reinforcement mechanism design to tackle the dynamic pricing problem in sponsored search auctions. In contrast to previous game-theoretical approaches that…

Computer Science and Game Theory · Computer Science 2017-11-29 Weiran Shen , Binghui Peng , Hanpeng Liu , Michael Zhang , Ruohan Qian , Yan Hong , Zhi Guo , Zongyao Ding , Pengjun Lu , Pingzhong Tang

A trading system is said to be {robust} if it generates a robust return regardless of market direction. To this end, a consistently positive expected trading gain is often used as a robustness metric for a trading system. In this paper, we…

Optimization and Control · Mathematics 2022-11-04 Chung-Han Hsieh

We introduce robust learning equilibrium. The idea of learning equilibrium is that learning algorithms in multi-agent systems should themselves be in equilibrium rather than only lead to equilibrium. That is, learning equilibrium is immune…

Computer Science and Game Theory · Computer Science 2012-07-02 Itai Ashlagi , Dov Monderer , Moshe Tennenholtz

In this paper, we study online double auctions, where multiple sellers and multiple buyers arrive and depart dynamically to exchange one commodity. We show that there is no deterministic online double auction that is truthful and…

Computer Science and Game Theory · Computer Science 2013-11-04 Dengji Zhao , Dongmo Zhang , Laurent Perrussel

We study the problem of fair online resource allocation via non-monetary mechanisms, where multiple agents repeatedly share a resource without monetary transfers. Previous work has shown that every agent can guarantee $1/2$ of their ideal…

Computer Science and Game Theory · Computer Science 2025-05-27 David X. Lin , Daniel Hall , Giannis Fikioris , Siddhartha Banerjee , Éva Tardos

Automated bidding, an emerging intelligent decision making paradigm powered by machine learning, has become popular in online advertising. Advertisers in automated bidding evaluate the cumulative utilities and have private financial…

Computer Science and Game Theory · Computer Science 2023-08-22 Yidan Xing , Zhilin Zhang , Zhenzhe Zheng , Chuan Yu , Jian Xu , Fan Wu , Guihai Chen

We consider a refinement to the notions of collusion-resistance in transaction fee mechanisms. In particular, we require that the collusion is by itself incentive-compatible and individually rational to all of its participants. We then…

Computer Science and Game Theory · Computer Science 2024-12-31 Matheus V. X. Ferreira , Yotam Gafni , Max Resnick

After experimentation with other designs, the major search engines converged on the weighted, generalized second-price auction (wGSP) for selling keyword advertisements. Notably, this convergence occurred before position auctions were well…

Computer Science and Game Theory · Computer Science 2014-08-05 David R. M Thompson , Kevin Leyton-Brown

We study the revenue performance of sequential posted price mechanisms and some natural extensions, for a general setting where the valuations of the buyers are drawn from a correlated distribution. Sequential posted price mechanisms are…

Computer Science and Game Theory · Computer Science 2015-10-02 Marek Adamczyk , Allan Borodin , Diodato Ferraioli , Bart de Keijzer , Stefano Leonardi

In the quest for market mechanisms that are easy to implement, yet close to optimal, few seem as viable as posted pricing. Despite the growing body of impressive results, the performance of most posted price mechanisms however, rely…

Computer Science and Game Theory · Computer Science 2016-09-23 Shreyas Sekar

We address the problem of improving bidders' strategies in prior-dependent revenue-maximizing auctions and introduce a simple and generic method to design novel bidding strategies if the seller uses past bids to optimize her mechanism. We…

Computer Science and Game Theory · Computer Science 2021-09-15 Thomas Nedelec , Marc Abeille , Clément Calauzènes , Benjamin Heymann , Vianney Perchet , Noureddine El Karoui

We study a repeated trading problem in which a mechanism designer facilitates trade between a single seller and multiple buyers. Our model generalizes the classic bilateral trade setting to a multi-buyer environment. Specifically, the…

Computer Science and Game Theory · Computer Science 2025-03-04 Anna Lunghi , Matteo Castiglioni , Alberto Marchesi