English
Related papers

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

200 papers

In many settings, money is a tool of exchange with minimal inherent utility --- agents will spend it in a way that maximizes the value of goods received subject to reasonable constraints, giving only second-order consideration to the…

Computer Science and Game Theory · Computer Science 2018-07-17 Christopher A Wilkens , Ruggiero Cavallo , Rad Niazadeh , Samuel Taggart

We design simple mechanisms to approximate the Gains from Trade (GFT) in two-sided markets with multiple unit-supply sellers and multiple unit-demand buyers. A classical impossibility result by Myerson and Satterthwaite showed that even…

Computer Science and Game Theory · Computer Science 2017-06-20 Johannes Brustle , Yang Cai , Fa Wu , Mingfei Zhao

In this paper, we study the non-stationary online second price auction problem. We assume that the seller is selling the same type of items in $T$ rounds by the second price auction, and she can set the reserve price in each round. In each…

Machine Learning · Computer Science 2019-11-15 Haoyu Zhao , Wei Chen

We study collusion in a second-price auction with two bidders in a dynamic environment. One bidder can make a take-it-or-leave-it collusion proposal, which consists of both an offer and a request of bribes, to the opponent. We show that…

Theoretical Economics · Economics 2021-05-31 Jingfeng Lu , Zongwei Lu , Christian Riis

Click models are an important tool for leveraging user feedback, and are used by commercial search engines for surfacing relevant search results. However, existing click models are lacking in two aspects. First, they do not share…

Information Retrieval · Computer Science 2014-01-03 Dinesh Govindaraj , Tao Wang , S. V. N. Vishwanathan

We study cardinal auctions for selling multiple copies of a good, in which bidders specify not only their bid or how much they are ready to pay for the good, but also a cardinality constraint on the number of copies that will be sold via…

Computer Science and Game Theory · Computer Science 2012-05-15 Mangesh Gupte , Darja Krushevskaja , S. Muthukrishnan

We study the combinatorial contracting problem of D\"utting et al. [FOCS '21], in which a principal seeks to incentivize an agent to take a set of costly actions. In their model, there is a binary outcome (the agent can succeed or fail),…

Computer Science and Game Theory · Computer Science 2023-09-20 Paul Dütting , Michal Feldman , Yoav Gal Tzur

In a two-round auction, a subset of bidders is selected (probabilistically), according to their bids in the first round, for the second round, where they can increase their bids. We formalize the two-round auction model, restricting the…

Computer Science and Game Theory · Computer Science 2023-12-08 Chulong Zhong , Xiang Yan , Yuyi Wang , Shuangping Huang , Jin Zhong

Classical Bayesian mechanism design relies on the common prior assumption, but such prior is often not available in practice. We study the design of prior-independent mechanisms that relax this assumption: the seller is selling an…

Theoretical Economics · Economics 2024-12-12 Jerry Anunrojwong , Santiago R. Balseiro , Omar Besbes

Existing auction mechanisms are vulnerable to bidder collusion, which substantially degrades revenue and non-colluder welfare. To design truthful mechanisms resilient to collusion, we introduce a novel approach that leverages a machine…

Computer Science and Game Theory · Computer Science 2026-05-11 Sukanya Kudva , Edward Dowling , Anil Aswani

We propose a new all-pay auction format in which risk-loving bidders pay a constant fee each time they bid for an object whose monetary value is common knowledge among the bidders, and bidding fees are the only source of benefit for the…

Computer Science and Game Theory · Computer Science 2016-03-03 Ali Kakhbod

Ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each time the publisher contacts the exchange, the exchange ``calls out'' to…

Computer Science and Game Theory · Computer Science 2015-03-13 Tanmoy Chakraborty , Eyal Even-Dar , Sudipto Guha , Yishay Mansour , S. Muthukrishnan

A seminal result of Bulow and Klemperer [1989] demonstrates the power of competition for extracting revenue: when selling a single item to $n$ bidders whose values are drawn i.i.d. from a regular distribution, the simple welfare-maximizing…

Computer Science and Game Theory · Computer Science 2016-12-30 Alon Eden , Michal Feldman , Ophir Friedler , Inbal Talgam-Cohen , S. Matthew Weinberg

I construct a novel random double auction as a robust bilateral trading mechanism for a profit-maximizing intermediary who facilitates trade between a buyer and a seller. It works as follows. The intermediary publicly commits to charging a…

Theoretical Economics · Economics 2022-05-11 Wanchang Zhang

Double-pushout rewriting is an established categorical approach to the rule-based transformation of graphs and graph-like objects. One of its standard results is the construction of concurrent rules and the Concurrency Theorem pertaining to…

Logic in Computer Science · Computer Science 2021-11-02 Jens Kosiol , Gabriele Taentzer

We study buyer-optimal procurement mechanisms when quality is contractible. When some costs are borne by every participant of a procurement auction regardless of winning, the classic analysis should be amended. We show that an optimal…

Theoretical Economics · Economics 2024-11-20 Pasha Andreyanov , Ilia Krasikov , Alex Suzdaltsev

We study the question of setting and testing reserve prices in single item auctions when the bidders are not identical. At a high level, there are two generalizations of the standard second price auction: in the lazy version we first…

Computer Science and Game Theory · Computer Science 2016-02-26 Renato Paes Leme , Martin Pal , Sergei Vassilvitskii

We consider the "Offline Ad Slot Scheduling" problem, where advertisers must be scheduled to "sponsored search" slots during a given period of time. Advertisers specify a budget constraint, as well as a maximum cost per click, and may not…

Computer Science and Game Theory · Computer Science 2008-01-21 Jon Feldman , S. Muthukrishnan , Evdokia Nikolova , Martin Pal

The declining price anomaly states that the price weakly decreases when multiple copies of an item are sold sequentially over time. The anomaly has been observed in a plethora of practical applications. On the theoretical side, Gale and…

Computer Science and Game Theory · Computer Science 2019-05-03 Vishnu V. Narayan , Enguerrand Prebet , Adrian Vetta

In a recent publication, using a simple two-period model, which is already capable to capture essential non-convex multiperiod bids, Richstein et al. have shown that in the case of optimal bidding, multi-part bidding always ensures a higher…

General Economics · Economics 2025-10-09 Dávid Csercsik , Mihály András Vághy
‹ Prev 1 3 4 5 6 7 10 Next ›