English
Related papers

Related papers: GSP with General Independent Click-Through-Rates

200 papers

We study the problem of designing a two-sided market (double auction) to maximize the gains from trade (social welfare) under the constraints of (dominant-strategy) incentive compatibility and budget-balance. Our goal is to do so for an…

Computer Science and Game Theory · Computer Science 2024-06-21 Moshe Babaioff , Amitai Frey , Noam Nisan

Bid shading has become a standard practice in the digital advertising industry, in which most auctions for advertising (ad) opportunities are now of first price type. Given an ad opportunity, performing bid shading requires estimating not…

Computer Science and Game Theory · Computer Science 2024-10-22 Yanlin Qu , Ravi Kant , Yan Chen , Brendan Kitts , San Gultekin , Aaron Flores , Jose Blanchet

A seller wants to sell a good to a set of bidders using a credible mechanism. We show that when the seller has private information about her cost, it is impossible for a static mechanism to achieve the optimal revenue. In particular, even…

Theoretical Economics · Economics 2025-09-29 Martino Banchio , Andrzej Skrzypacz , Frank Yang

With the increasing use of auctions in online advertising, there has been a large effort to study seller revenue maximization, following Myerson's seminal work, both theoretically and practically. We take the point of view of the buyer in…

Computer Science and Game Theory · Computer Science 2019-03-27 Marc Abeille , Clément Calauzènes , Noureddine El Karoui , Thomas Nedelec , Vianney Perchet

The transition of display ad exchanges from second-price auctions (SPA) to first-price auctions (FPA) has raised questions about its impact on revenue. Auction theory predicts the revenue equivalence between these two auction formats.…

Computer Science and Game Theory · Computer Science 2024-12-04 Martin Bichler , Alok Gupta , Matthias Oberlechner

We study mechanism design when agents may have hidden secondary goals which will manifest as non-trivial preferences among outcomes for which their primary utility is the same. We show that in such cases, a mechanism is robust against…

Computer Science and Game Theory · Computer Science 2023-07-25 Renato Paes Leme , Jon Schneider , Hanrui Zhang

We consider two sided matching markets consisting of agents with non-transferable utilities; agents from the opposite sides form matching pairs (e.g., buyers-sellers) and negotiate the terms of their math which may include a monetary…

Computer Science and Game Theory · Computer Science 2012-12-05 Saeed Alaei , Kamal Jain , Azarakhsh Malekian

A seller wants to sell an item to $n$ buyers. Buyer valuations are drawn i.i.d. from a distribution unknown to the seller; the seller only knows that the support is included in $[a, b]$. To be robust, the seller chooses a DSIC mechanism…

Theoretical Economics · Economics 2025-01-03 Jerry Anunrojwong , Santiago R. Balseiro , Omar Besbes

The connection between games and no-regret algorithms has been widely studied in the literature. A fundamental result is that when all players play no-regret strategies, this produces a sequence of actions whose time-average is a…

Computer Science and Game Theory · Computer Science 2020-09-15 Zhe Feng , Guru Guruganesh , Christopher Liaw , Aranyak Mehta , Abhishek Sethi

Secondary spectrum auction is widely applied in wireless networks for mitigating the spectrum scarcity. In a realistic spectrum trading market, the requests from secondary users often specify the usage of a fixed spectrum frequency band in…

Computer Science and Game Theory · Computer Science 2012-08-02 He Huang , Yu-e Sun , Xiang-yang Li , Hongli Xu , Yousong Zhou , Liusheng Huang

In the Bidder Selection Problem (BSP) there is a large pool of $n$ potential advertisers competing for ad slots on the user's web page. Due to strict computational restrictions, the advertising platform can run a proper auction only for a…

Computer Science and Game Theory · Computer Science 2024-04-30 Nickolai Gravin , Yixuan Even Xu , Renfei Zhou

This paper investigates the problem of proportionally fair double sided energy auction involving buying and selling agents. The grid is assumed to be operating under islanded mode. A distributed auction algorithm that can be implemented by…

Computer Science and Game Theory · Computer Science 2016-05-24 M. Nazif Faqiry , Sanjoy Das

This paper investigates reverse auctions that involve continuous values of different types of goods, general nonconvex constraints, and second stage costs. We seek to design the payment rules and conditions under which coalitions of…

Computer Science and Game Theory · Computer Science 2021-07-14 Orcun Karaca , Pier Giuseppe Sessa , Neil Walton , Maryam Kamgarpour

We consider the optimal pricing problem for a model of the rich media advertisement market, as well as other related applications. In this market, there are multiple buyers (advertisers), and items (slots) that are arranged in a line such…

Computer Science and Game Theory · Computer Science 2013-08-07 Xiaotie Deng , Paul Goldberg , Yang Sun , Bo Tang , Jinshan Zhang

We present a deterministic exploration mechanism for sponsored search auctions, which enables the auctioneer to learn the relevance scores of advertisers, and allows advertisers to estimate the true value of clicks generated at the auction…

Computer Science and Game Theory · Computer Science 2011-11-10 Sudhir Kumar Singh , Vwani P. Roychowdhury , Milan Bradonjić , Behnam A. Rezaei

In a sponsored search auction, decisions about how to rank ads impose tradeoffs between objectives such as revenue and welfare. In this paper, we examine how these tradeoffs should be made. We begin by arguing that the most natural solution…

Computer Science and Game Theory · Computer Science 2013-04-30 Ben Roberts , Dinan Gunawardena , Ian A. Kash , Peter Key

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

Most modern financial markets use a continuous double auction mechanism to store and match orders and facilitate trading. In this paper we develop a microscopic dynamical statistical model for the continuous double auction under the…

Statistical Mechanics · Physics 2009-11-07 Eric Smith , J. Doyne Farmer , Laszlo Gillemot , Supriya Krishnamurthy

In many settings agents participate in multiple different auctions that are not necessarily implemented simultaneously. Future opportunities affect strategic considerations of the players in each auction, introducing externalities.…

Computer Science and Game Theory · Computer Science 2011-12-30 Renato Paes Leme , Vasilis Syrgkanis , Eva Tardos

Investigating potential purchases is often a substantial investment under uncertainty. Standard market designs, such as simultaneous or English auctions, compound this with uncertainty about the price a bidder will have to pay in order to…

Computer Science and Game Theory · Computer Science 2016-12-22 Robert Kleinberg , Bo Waggoner , E. Glen Weyl
‹ Prev 1 4 5 6 7 8 10 Next ›