English
Related papers

Related papers: Simple vs Optimal Mechanisms in Auctions with Conv…

200 papers

It has become the default in markets such as ad auctions for participants to bid in an auction through automated bidding agents (autobidders) which adjust bids over time to satisfy return-over-spend constraints. Despite the prominence of…

Computer Science and Game Theory · Computer Science 2024-07-03 Renato Paes Leme , Georgios Piliouras , Jon Schneider , Kelly Spendlove , Song Zuo

I study the design of auctions in which the auctioneer is assumed to have information only about the marginal distribution of a generic bidder's valuation, but does not know the correlation structure of the joint distribution of bidders'…

Theoretical Economics · Economics 2022-05-10 Wanchang Zhang

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

Consider a trade market with one seller and multiple buyers. The seller aims to sell an indivisible item and maximize their revenue. This paper focuses on a simple and popular mechanism--the fixed-price mechanism. Unlike the standard…

Computer Science and Game Theory · Computer Science 2024-11-19 Zhikang Fan , Weiran Shen

We study the price of anarchy of mechanisms in the presence of risk-averse agents. Previous work has focused on agents with quasilinear utilities, possibly with a budget. Our model subsumes this as a special case but also captures that…

Computer Science and Game Theory · Computer Science 2018-04-26 Thomas Kesselheim , Bojana Kodric

Traditionally, the Bayesian optimal auction design problem has been considered either when the bidder values are i.i.d., or when each bidder is individually identifiable via her value distribution. The latter is a reasonable approach when…

Computer Science and Game Theory · Computer Science 2023-07-11 Nikhil R. Devanur , Zhiyi Huang , Christos-Alexandros Psomas

We study multidimensional mechanism design in a common scenario where players have private information about their willingness to pay and their ability to pay. We provide a complete characterization of dominant-strategy incentive-compatible…

Computer Science and Game Theory · Computer Science 2014-05-01 Ahuva Mualem

Contemporary real-world online ad auctions differ from canonical models [Edelman et al., 2007; Varian, 2009] in at least four ways: (1) values and click-through rates can depend upon users' search queries, but advertisers can only partially…

Machine Learning · Computer Science 2024-04-11 Ming Chen , Sareh Nabi , Marciano Siniscalchi

We present a number of models for the adword auctions used for pricing advertising slots on search engines such as Google, Yahoo! etc. We begin with a general problem formulation which allows the privately known valuation per click to be a…

Computer Science and Game Theory · Computer Science 2007-05-23 Garud Iyengar , Anuj Kumar

We are interested in the setting where a seller sells sequentially arriving items, one per period, via a dynamic auction. At the beginning of each period, each buyer draws a private valuation for the item to be sold in that period and this…

Computer Science and Game Theory · Computer Science 2018-12-10 Vahab Mirrokni , Renato Paes Leme , Pingzhong Tang , Song Zuo

The fast growth of communication technology within the concept of smart grids can provide data and control signals from/to all consumers in an online fashion. This could foster more participation for end-user customers. These types of…

Systems and Control · Electrical Eng. & Systems 2020-09-11 Arman Alahyari , David Pozo

Fairness in advertising is a topic of particular concern motivated by theoretical and empirical observations in both the computer science and economics literature. We examine the problem of fairness in advertising for general purpose…

Computer Science and Game Theory · Computer Science 2019-08-30 Shuchi Chawla , Christina Ilvento , Meena Jagadeesan

Classic results show that even an arbitrarily small correlation across bidders' information can enable full surplus extraction in auctions and related mechanism design settings. Motivated by this fragility, we study the information…

Computer Science and Game Theory · Computer Science 2026-04-28 Boyu Liu , Wei Tang , Zihe Wang , Shuo Zhang

All-pay auctions, a common mechanism for various human and agent interactions, suffers, like many other mechanisms, from the possibility of players' failure to participate in the auction. We model such failures, and fully characterize…

Computer Science and Game Theory · Computer Science 2017-02-15 Yoad Lewenberg , Omer Lev , Yoram Bachrach , Jeffrey S. Rosenschein

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

We study the problem of finding the optimal bidding strategy for an advertiser in a multi-platform auction setting. The competition on a platform is captured by a value and a cost function, mapping bidding strategies to value and cost…

Computer Science and Game Theory · Computer Science 2025-02-27 Gagan Aggarwal , Anupam Gupta , Xizhi Tan , Mingfei Zhao

We study the equilibria of uniform price auctions where many asymmetric bidders have flat demands up to their respective quantity constraints. We present an iterative procedure that systematically finds an equilibrium outcome as well as an…

Theoretical Economics · Economics 2026-04-09 Kiho Yoon

Online advertising platforms are thriving due to the customizable audiences they offer advertisers. However, recent studies show that advertisements can be discriminatory with respect to the gender or race of the audience that sees the ad,…

Computer Science and Game Theory · Computer Science 2019-05-23 L. Elisa Celis , Anay Mehrotra , Nisheeth K. Vishnoi

This note pursues two primary objectives. First, we analyze the outcomes of an all-pay auction within a store where buyers with and without financial constraints arrive at varying rates, and where buyer types are private information.…

Theoretical Economics · Economics 2024-04-16 Cemil Selcuk

Constraints on agent's ability to pay play a major role in auction design for any setting where the magnitude of financial transactions is sufficiently large. Those constraints have been traditionally modeled in mechanism design as…

Computer Science and Game Theory · Computer Science 2014-04-22 Gagan Goel , Vahab Mirrokni , Renato Paes Leme
‹ Prev 1 8 9 10 Next ›