English
Related papers

Related papers: Random Double Auction: A Robust Bilateral Trading …

200 papers

A diffusion auction refers to a selling process conducted over a social network, where each participant submits a bid and may invite other potential buyers to join the auction. Although various mechanisms have been proposed, none of them…

Computer Science and Game Theory · Computer Science 2026-05-19 Xinlun Zhang , Zhechen Li , Yongzhi Cao , Yu Huang , Hanpin Wang

We design a fixed-price auction mechanism for a seller to sell multiple items in a tree-structured market. The buyers have independently drawn valuation from a uniform distribution, and the seller would like to incentivize buyers to invite…

Computer Science and Game Theory · Computer Science 2024-08-01 Feiyang Yu

The current art in optimal combinatorial auctions is limited to handling the case of single units of multiple items, with each bidder bidding on exactly one bundle (single minded bidders). This paper extends the current art by proposing an…

Computer Science and Game Theory · Computer Science 2010-04-27 Sujit Gujar , Y Narahari

We consider the problem of optimal bidding for virtual trading in two-settlement electricity markets. A virtual trader aims to arbitrage on the differences between day-ahead and real-time market prices; both prices, however, are random and…

Computer Science and Game Theory · Computer Science 2018-08-02 Sevi Baltaoglu , Lang Tong , Qing Zhao

We study non-monetary mechanisms for the fair and efficient allocation of reusable public resources, i.e., resources used for varying durations. We consider settings where a limited resource is repeatedly shared among a set of agents, each…

Computer Science and Game Theory · Computer Science 2023-10-17 Siddhartha Banerjee , Giannis Fikioris , Éva Tardos

In this paper, I introduce a profit-maximizing centralized marketplace into a decentralized market with search frictions. Agents choose between the centralized marketplace and the decentralized bilateral trade. I characterize the optimal…

Theoretical Economics · Economics 2021-11-29 Berk Idem

We consider online procurement auctions, where the agents arrive sequentially, in random order, and have private costs for their services. The buyer aims to maximize a monotone submodular value function for the subset of agents whose…

Computer Science and Game Theory · Computer Science 2025-04-15 Andreas Charalampopoulos , Dimitris Fotakis , Panagiotis Patsilinakos , Thanos Tolias

In traditional public blockchain networks, transaction fees are only allocated to full nodes (i.e., miners). However, the lack of relay rewards reduces the willingness of light nodes to relay transactions, especially in the…

Networking and Internet Architecture · Computer Science 2024-01-25 Weiyi Wang , Yutao Jiao , Jin Chen , Wenting Dai , Jiawen Kang , Yuhua Xu

We study bilateral trade between two strategic agents. The celebrated result of Myerson and Satterthwaite states that in general, no incentive-compatible, individually rational and weakly budget balanced mechanism can be efficient. I.e., no…

Computer Science and Game Theory · Computer Science 2021-11-08 Yuan Deng , Jieming Mao , Balasubramanian Sivan , Kangning Wang

Financial options are contracts that specify the right to buy or sell an underlying asset at a strike price by an expiration date. Standard exchanges offer options of predetermined strike values and trade options of different strikes…

Computer Science and Game Theory · Computer Science 2021-09-15 Xintong Wang , David M. Pennock , Nikhil R. Devanur , David M. Rothschild , Biaoshuai Tao , Michael P. Wellman

We investigate revenue maximization problems in auctions for dynamic spectrum access. We consider the frequency division and spread spectrum methods of dynamic spectrum sharing. In the frequency division method, a primary spectrum user…

Optimization and Control · Mathematics 2011-05-31 Ali Kakhbod , Ashutosh Nayyar , Demosthenis Teneketzis

We consider a double-auction mechanism, which was recently proposed in the context of rate allocation in mobile data-offloading markets. Network operators (users) derive benefit from offloading their traffic to third party WiFi or femtocell…

Networking and Internet Architecture · Computer Science 2021-02-10 K P Naveen , Rajesh Sundaresan

We study a class of iterative combinatorial auctions which can be viewed as subgradient descent methods for the problem of pricing bundles to balance supply and demand. We provide concrete convergence rates for auctions in this class,…

Computer Science and Game Theory · Computer Science 2016-06-01 Jacob Abernethy , Sébastien Lahaie , Matus Telgarsky

In this paper, we study sequential auctions with two budget constrained bidders and any number of identical items. All prior results on such auctions consider only two items. We construct a canonical outcome of the auction that is the only…

Computer Science and Game Theory · Computer Science 2012-09-11 Zhiyi Huang , Nikhil R. Devanur , David Malec

Simultaneous ascending auctions present agents with the exposure problem: bidding to acquire a bundle risks the possibility of obtaining an undesired subset of the goods. Auction theory provides little guidance for dealing with this…

Computer Science and Game Theory · Computer Science 2012-07-09 Anna Osepayshvili , Michael P. Wellman , Daniel Reeves , Jeffrey K. MacKie-Mason

The celebrated Myerson--Satterthwaite theorem shows that in bilateral trade, no mechanism can be simultaneously fully efficient, Bayesian incentive compatible (BIC), and budget balanced (BB). This naturally raises the question of how…

Machine Learning · Computer Science 2026-03-10 Yang Cai , Vineet Gupta , Zun Li , Aranyak Mehta

We consider the problem of maximizing the gains from trade (GFT) in two-sided markets. The seminal impossibility result by Myerson and Satterthwaite shows that even for bilateral trade, there is no individually rational (IR), Bayesian…

Computer Science and Game Theory · Computer Science 2024-04-01 Yang Cai , Christopher Liaw , Aranyak Mehta , Mingfei Zhao

A standing assumption in the literature on proportional transaction costs is efficient friction. Together with robust no free lunch with vanishing risk, it rules out strategies of infinite variation, as they usually appear in frictionless…

Mathematical Finance · Quantitative Finance 2023-06-21 Christoph Kühn , Alexander Molitor

There has been much recent work on the revenue-raising properties of truthful mechanisms for selling goods to selfish bidders. Typically the revenue of a mechanism is compared against a benchmark (such as, the maximum revenue obtainable by…

Computer Science and Game Theory · Computer Science 2013-01-14 Paul W. Goldberg , Carmine Ventre

We characterise the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting. In such a setting there is a single…

Computer Science and Game Theory · Computer Science 2018-11-14 Matthias Gerstgrasser , Paul W. Goldberg , Bart de Keijzer , Philip Lazos , Alexander Skopalik