English
Related papers

Related papers: Optimal Diffusion Auctions

200 papers

Recommender systems remain an essential topic due to its wide application and business potential. Given the great generation capability exhibited by diffusion models in computer vision recently, many recommender systems have adopted…

Information Retrieval · Computer Science 2026-03-03 Ting-Ruen Wei , Yi Fang

In online advertising markets, budget-constrained advertisers acquire ad placements through repeated bidding in auctions on various platforms. We present a strategy for bidding optimally in a set of auctions that may or may not be…

Computer Science and Game Theory · Computer Science 2023-06-14 Fransisca Susan , Negin Golrezaei , Okke Schrijvers

Auction design for the modern advertising market has gained significant prominence in the field of game theory. With the recent rise of auto-bidding tools, an increasing number of advertisers in the market are utilizing these tools for…

Computer Science and Game Theory · Computer Science 2024-12-31 Changfeng Xu , Chao Peng , Chenyang Xu , Zhengfeng Yang

Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been a lot of attention on the auction process and its game-theoretic aspects, our focus is on the advertisers. In particular,…

Data Structures and Algorithms · Computer Science 2007-05-23 Jon Feldman , S. Muthukrishnan , Martin Pal , Cliff Stein

This paper describes an optimization model for setting bid levels for certain types of advertisements on web pages. This model is non-convex, but we are able to obtain optimal or near-optimal solutions rapidly using branch and cut…

Discrete Mathematics · Computer Science 2007-06-27 Ralphe Wiggins , John A. Tomlin

We study sequential procurement auctions where the sellers are provided with a ``best and final offer'' (BAFO) strategy. This strategy allows each seller $i$ to effectively ``freeze'' their price while remaining active in the auction, and…

Computer Science and Game Theory · Computer Science 2025-03-17 Vasilis Gkatzelis , Randolph Preston McAfee , Renato Paes Leme

We study revenue maximization by deterministic mechanisms for the simplest case for which Myerson's characterization does not hold: a single seller selling two items, with independently distributed values, to a single additive buyer. We…

Computer Science and Game Theory · Computer Science 2018-04-20 Moshe Babaioff , Noam Nisan , Aviad Rubinstein

Assortment optimization concerns the problem of selling items with fixed prices to a buyer who will purchase at most one. Typically, retailers select a subset of items, corresponding to an "assortment" of brands to carry, and make each…

Computer Science and Game Theory · Computer Science 2022-05-23 Will Ma

Demand response has been a promising solution for accommodating renewable energy in power systems. In this study, we consider a demand response scheme within a distribution network facing an energy supply deficit. The utility company…

Systems and Control · Electrical Eng. & Systems 2024-04-02 Xiupeng Chen , Jacquelien M. A. Scherpen , Nima Monshizadeh

We consider a market where a set of objects is sold to a set of buyers, each equipped with a valuation function for the objects. The goal of the auctioneer is to determine reasonable prices together with a stable allocation. One definition…

Computer Science and Game Theory · Computer Science 2024-05-22 Katharina Eickhoff , S. Thomas McCormick , Britta Peis , Niklas Rieken , Laura Vargas Koch

Digital advertising constitutes one of the main revenue sources for online platforms. In recent years, some advertisers tend to adopt auto-bidding tools to facilitate advertising performance optimization, making the classical \emph{utility…

Computer Science and Game Theory · Computer Science 2022-12-01 Hongtao Lv , Zhilin Zhang , Zhenzhe Zheng , Jinghan Liu , Chuan Yu , Lei Liu , Lizhen Cui , Fan Wu

In digital goods auctions, there is an auctioneer who sells an item with unlimited supply to a set of potential buyers, and the objective is to design truthful auction to maximize the total profit of the auctioneer. Motivated from an…

Computer Science and Game Theory · Computer Science 2011-07-27 Nick Gravin , Pinyan Lu

Standard procurement models assume that the buyer knows the quality of the good at the time of procurement; however, in many settings, the quality is learned only long after the transaction. We study procurement problems in which the…

Theoretical Economics · Economics 2026-04-03 Kun Zhang

A decision maker is choosing between an active action (e.g., purchase a house, invest certain stock) and a passive action. The payoff of the active action depends on the buyer's private type and also an unknown state of nature. An…

Computer Science and Game Theory · Computer Science 2021-10-29 Shuze Liu , Weiran Shen , Haifeng Xu

A seller chooses a reserve price in a second-price auction to maximize worst-case expected revenue when she knows only the mean of value distribution and an upper bound on either values themselves or variance. Values are private and iid.…

Theoretical Economics · Economics 2020-08-10 Alex Suzdaltsev

In economics, there are many ways to describe the interaction between a "seller" and a "buyer". The most common one, with which we interact almost every day, is selling for a fixed price. This option is perfect for selling a mass product,…

General Finance · Quantitative Finance 2024-07-10 O. A. Malafeyev , I. E. Khomenko

Recently there has been a large amount of research designing mechanisms for auction scenarios where the bidders are connected in a social network. Different from the existing studies in this field that focus on specific auction scenarios…

Computer Science and Game Theory · Computer Science 2024-08-09 Yuan Fang , Mengxiao Zhang , Jiamou Liu , Bakh Khoussainov

We consider revenue-optimal mechanism design in the interdimensional setting, where one dimension is the 'value' of the buyer, and one is a 'type' that captures some auxiliary information. One setting is the FedEx Problem, for which FGKK…

Computer Science and Game Theory · Computer Science 2020-02-18 Nikhil Devanur , Kira Goldner , Raghuvansh Saxena , Ariel Schvartzman , S. Matthew Weinberg

We design profit-maximizing mechanisms to sell an excludable and non-rival good with positive and/or negative network effects. Buyers have heterogeneous private values that depend on how many others also consume the good. In optimum, an…

Theoretical Economics · Economics 2025-07-31 Vincent Meisner , Pascal Pillath

Combinatorial Auctions are a central problem in Algorithmic Mechanism Design: pricing and allocating goods to buyers with complex preferences in order to maximize some desired objective (e.g., social welfare, revenue, or profit). The…

Computer Science and Game Theory · Computer Science 2015-03-19 Avrim Blum , Anupam Gupta , Yishay Mansour , Ankit Sharma