Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Lahaie, Sébastien"'
In the field of computational advertising, the integration of ads into the outputs of large language models (LLMs) presents an opportunity to support these services without compromising content integrity. This paper introduces novel auction mechanism
Externí odkaz:
http://arxiv.org/abs/2406.09459
Autor:
Doudchenko, Nick, Khosravi, Khashayar, Pouget-Abadie, Jean, Lahaie, Sebastien, Lubin, Miles, Mirrokni, Vahab, Spiess, Jann, Imbens, Guido
We investigate the optimal design of experimental studies that have pre-treatment outcome data available. The average treatment effect is estimated as the difference between the weighted average outcomes of the treated and control units. A number of
Externí odkaz:
http://arxiv.org/abs/2112.00278
Autor:
Feng, Zhe, Lahaie, Sébastien
Setting an effective reserve price for strategic bidders in repeated auctions is a central question in online advertising. In this paper, we investigate how to set an anonymous reserve price in repeated auctions based on historical bids in a way that
Externí odkaz:
http://arxiv.org/abs/2107.04638
The display advertising industry has recently transitioned from second- to first-price auctions as its primary mechanism for ad allocation and pricing. In light of this, publishers need to re-evaluate and optimize their auction parameters, notably re
Externí odkaz:
http://arxiv.org/abs/2006.06519
The problem of market clearing is to set a price for an item such that quantity demanded equals quantity supplied. In this work, we cast the problem of predicting clearing prices into a learning framework and use the resulting models to perform reven
Externí odkaz:
http://arxiv.org/abs/1906.01184
Iterative combinatorial auctions (CAs) are often used in multi-billion dollar domains like spectrum auctions, and speed of convergence is one of the crucial factors behind the choice of a specific design for practical applications. To achieve fast co
Externí odkaz:
http://arxiv.org/abs/1809.05340
Autor:
Brero, Gianluca, Lahaie, Sébastien
We cast the problem of combinatorial auction design in a Bayesian framework in order to incorporate prior information into the auction process and minimize the number of rounds to convergence. We first develop a generative model of agent valuations a
Externí odkaz:
http://arxiv.org/abs/1712.05291
Autor:
Farhadi, Alireza, Ghodsi, Mohammad, Hajiaghayi, MohammadTaghi, Lahaie, Sebastien, Pennock, David, Seddighin, Masoud, Seddighin, Saeed, Yami, Hadi
We study fair allocation of indivisible goods to agents with unequal entitlements. Fair allocation has been the subject of many studies in both divisible and indivisible settings. Our emphasis is on the case where the goods are indivisible and agents
Externí odkaz:
http://arxiv.org/abs/1703.01649
Publikováno v:
Advances in Neural Information Processing Systems 30 (NIPS 2017)
We analyze sources of error in prediction market forecasts in order to bound the difference between a security's price and the ground truth it estimates. We consider cost-function-based prediction markets in which an automated market maker adjusts se
Externí odkaz:
http://arxiv.org/abs/1702.07810
A prediction market is a useful means of aggregating information about a future event. To function, the market needs a trusted entity who will verify the true outcome in the end. Motivated by the recent introduction of decentralized prediction market
Externí odkaz:
http://arxiv.org/abs/1612.04885