English
Related papers

Related papers: Reducing Inefficiency in Carbon Auctions with Impe…

200 papers

When agents with independent priors bid for a single item, Myerson's optimal auction maximizes expected revenue, whereas Vickrey's second-price auction optimizes social welfare. We address the natural question of trade-offs between the two…

Computer Science and Game Theory · Computer Science 2012-05-15 Ilias Diakonikolas , Christos Papadimitriou , George Pierrakos , Yaron Singer

A central problem in Microeconomics is to design auctions with good revenue properties. In this setting, the bidders' valuations for the items are private knowledge, but they are drawn from publicly known prior distributions. The goal is to…

Computer Science and Game Theory · Computer Science 2013-01-11 Sayan Bhattacharya , Janardhan Kulkarni , Xiaoming Xu

Many auction settings implicitly or explicitly require that bidders are treated equally ex-ante. This may be because discrimination is philosophically or legally impermissible, or because it is practically difficult to implement or…

Computer Science and Game Theory · Computer Science 2014-11-06 Christos Tzamos , Christopher A. Wilkens

We introduce draft auctions, which is a sequential auction format where at each iteration players bid for the right to buy items at a fixed price. We show that draft auctions offer an exponential improvement in social welfare at equilibrium…

Computer Science and Game Theory · Computer Science 2013-11-13 Nikhil R. Devanur , Jamie Morgenstern , Vasilis Syrgkanis

Secondary markets and resale are integral components of all emission trading systems. Despite the justification for these secondary trades, such as unpredictable demand, they may encourage speculation and result in the misallocation of…

Theoretical Economics · Economics 2024-07-11 Peyman Khezr

We study the classic single-item auction setting of Myerson, but under the assumption that the buyers' values for the item are distributed over finite supports. Using strong LP duality and polyhedral theory, we rederive various key results…

Computer Science and Game Theory · Computer Science 2025-01-27 Yiannis Giannakopoulos , Johannes Hahn

Recent empirical work demonstrates that online advertisement can exhibit bias in the delivery of ads across users even when all advertisers bid in a non-discriminatory manner. We study the design of ad auctions that, given fair bids, are…

Computer Science and Game Theory · Computer Science 2021-12-02 Shuchi Chawla , Meena Jagadeesan

In this work, we study spectrum auction problem where each request from secondary users has spatial, temporal, and spectral features. With the requests of secondary users and the reserve price of the primary user, our goal is to design…

Networking and Internet Architecture · Computer Science 2013-05-29 Yu-e Sun , He Huang , Xiang-Yang Li , Zhili Chen , Wei Yang , Hongli Xu , Liusheng Huang

The goal of an auction is to determine commodity prices such that all participants are perfectly happy. Such a solution is called a competitive equilibrium and does not exist in general. For this reason we are interested in solutions which…

Optimization and Control · Mathematics 2013-09-04 Johannes C. Müller

Most of the work in the auction design literature assumes that bidders behave rationally based on the information available for every individual auction, and the revelation principle enables designers to restrict their efforts to incentive…

Computer Science and Game Theory · Computer Science 2024-05-14 Juncheng Li , Pingzhong Tang

This paper proposes a novel framework to price energy storage in economic dispatch with a social welfare maximization objective. This framework can be utilized by power system operators to generate default bids for storage or to benchmark…

Systems and Control · Electrical Eng. & Systems 2026-05-08 Ning Qi , Ningkun Zheng , Bolun Xu

We incorporate signaling scheme into Ad Auction setting, to achieve better welfare and revenue while protect users' privacy. We propose a new \emph{$K$-anonymous signaling scheme setting}, prove the hardness of the corresponding…

Computer Science and Game Theory · Computer Science 2013-11-28 Binyi Chen , Tao Qin , Tie-Yan Liu

We provide a computationally efficient black-box reduction from mechanism design to algorithm design in very general settings. Specifically, we give an approximation-preserving reduction from truthfully maximizing \emph{any} objective under…

Computer Science and Game Theory · Computer Science 2013-05-20 Yang Cai , Constantinos Daskalakis , S. Matthew Weinberg

Online bidding serves as a fundamental information system in mobile ecosystems, facilitating real-time ad allocation across billions of devices while optimizing both platform performance and user experience through data-driven decision…

Computer Science and Game Theory · Computer Science 2026-01-07 Huanyu Yan , Yu Huo , Min Lu , Weitong Ou , Xingyan Shi , Ruihe Shi , Xiaoying Tang

Lately, Non-Fungible Tokens (NFTs), i.e., uniquely discernible assets on a blockchain, have skyrocketed in popularity by addressing a broad audience. However, the typical NFT auctioning procedures are conducted in various, ad hoc ways,…

Computer Science and Game Theory · Computer Science 2022-09-26 Jason Milionis , Dean Hirsch , Andy Arditi , Pranav Garimidi

We study equilibria of markets with $m$ heterogeneous indivisible goods and $n$ consumers with combinatorial preferences. It is well known that a competitive equilibrium is not guaranteed to exist when valuations are not gross substitutes.…

Computer Science and Game Theory · Computer Science 2014-06-04 Shahar Dobzinski , Michal Feldman , Inbal Talgam-Cohen , Omri Weinstein

Central to privacy concerns is that firms may use consumer data to price discriminate. A common policy response is that consumers should be given control over which firms access their data and how. Since firms learn about a consumer's…

Theoretical Economics · Economics 2020-08-18 S. Nageeb Ali , Greg Lewis , Shoshana Vasserman

A common practice in many auctions is to offer bidders an opportunity to improve their bids, known as a Best and Final Offer (BAFO) stage. This final bid can depend on new information provided about either the asset or the competitors. This…

Computer Science and Game Theory · Computer Science 2021-04-21 Galit Ashkenazi-Golan , Yevgeny Tsodikovich , Yannick Viossat

We study the bidding problem in repeated uniform price multi-unit auctions from the perspective of a value-maximizing buyer. The buyer aims to maximize their cumulative value over $T$ rounds while adhering to per-round return-on-investment…

Data Structures and Algorithms · Computer Science 2025-10-07 Negin Golrezaei , Sourav Sahoo

Energy storage (ES) can help decarbonize power systems by transferring green renewable energy across time. How to unlock the potential of ES in cutting carbon emissions by appropriate market incentives has become a crucial, albeit…

Optimization and Control · Mathematics 2024-03-14 Rui Xie , Yue Chen