中文
相关论文

相关论文: The Biased Sampling Profit Extraction Auction

200 篇论文

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…

计算机科学与博弈论 · 计算机科学 2023-06-14 Fransisca Susan , Negin Golrezaei , Okke Schrijvers

We study the problem of reducing the variance of Monte Carlo estimators through performing suitable changes of the sampling measure which are induced by feedforward neural networks. To this end, building on the concept of vector stochastic…

计算金融 · 定量金融 2023-06-05 Aleksandar Arandjelović , Thorsten Rheinländer , Pavel V. Shevchenko

We consider the problem of chance constrained optimization where it is sought to optimize a function and satisfy constraints, both of which are affected by uncertainties. The real world declinations of this problem are particularly…

In the context of advertising auctions, finding good reserve prices is a notoriously challenging learning problem. This is due to the heterogeneity of ad opportunity types and the non-convexity of the objective function. In this work, we…

机器学习 · 计算机科学 2017-11-07 Andrés Muñoz Medina , Sergei Vassilvitskii

We study the performance of the TimeBoost auction, by comparing cumulative fixed time markout of fast lane trades over the TimeBoost interval to bids for the fast lane. Such comparison allows us to assess how well bids predict future…

计算机科学与博弈论 · 计算机科学 2025-11-25 Akaki Mamageishvili , Christoph Schlegel , Ko Sunghun , Jinsuk Park , Ali Taslimi

Data selection is essential for any data-based optimization technique, such as Reinforcement Learning. State-of-the-art sampling strategies for the experience replay buffer improve the performance of the Reinforcement Learning agent.…

We study the problem of setting a price for a potential buyer with a valuation drawn from an unknown distribution $D$. The seller has "data"' about $D$ in the form of $m \ge 1$ i.i.d. samples, and the algorithmic challenge is to use these…

计算机科学与博弈论 · 计算机科学 2015-02-12 Zhiyi Huang , Yishay Mansour , Tim Roughgarden

The enhanced competition paradigm is an attempt at bridging the gap between simple and optimal auctions. In this line of work, given an auction setting with $m$ items and $n$ bidders, the goal is to find the smallest $n' \geq n$ such that…

计算机科学与博弈论 · 计算机科学 2021-05-19 Linda Cai , Raghuvansh R. Saxena

Auctions with partially-revealed information about items are broadly employed in real-world applications, but the underlying mechanisms have limited theoretical support. In this work, we study a machine learning formulation of these types…

机器学习 · 计算机科学 2022-07-06 Wenshuo Guo , Michael I. Jordan , Ellen Vitercik

We study how to maximize the broker's (expected) profit in a two-sided market, where she buys items from a set of sellers and resells them to a set of buyers. Each seller has a single item to sell and holds a private value on her item, and…

计算机科学与博弈论 · 计算机科学 2019-05-24 Jing Chen , Bo Li , Yingkai Li

In the quest for market mechanisms that are easy to implement, yet close to optimal, few seem as viable as posted pricing. Despite the growing body of impressive results, the performance of most posted price mechanisms however, rely…

计算机科学与博弈论 · 计算机科学 2016-09-23 Shreyas Sekar

We present a quantum auction protocol using superpositions to represent bids and distributed search to identify the winner(s). Measuring the final quantum state gives the auction outcome while simultaneously destroying the superposition.…

量子物理 · 物理学 2007-11-26 Tad Hogg , Pavithra Harsha , Kay-Yut Chen

In this paper, the optimal sampling strategies (uniform or nonuniform) and distortion tradeoffs for Gaussian bandlimited periodic signals with additive white Gaussian noise are studied. Our emphasis is on characterizing the optimal sampling…

信息论 · 计算机科学 2016-11-01 Elaheh Mohammadi , Farokh Marvasti

In a seminal paper, McAfee (1992) presented a truthful mechanism for double auctions, attaining asymptotically-optimal gain-from-trade without any prior information on the valuations of the traders. McAfee's mechanism handles…

计算机科学与博弈论 · 计算机科学 2017-12-20 Erel Segal-Halevi , Avinatan Hassidim , Yonatan Aumann

We introduce a new numerical framework to learn optimal bidding strategies in repeated auctions when the seller uses past bids to optimize her mechanism. Crucially, we do not assume that the bidders know what optimization mechanism is used…

计算机科学与博弈论 · 计算机科学 2021-02-09 Thomas Nedelec , Jules Baudet , Vianney Perchet , Noureddine El Karoui

A recent approach to automated mechanism design, differentiable economics, represents auctions by rich function approximators and optimizes their performance by gradient descent. The ideal auction architecture for differentiable economics…

计算机科学与博弈论 · 计算机科学 2022-02-08 Michael Curry , Tuomas Sandholm , John Dickerson

Buyers (e.g., advertisers) often have limited financial and processing resources, and so their participation in auctions is throttled. Changes to auctions may affect bids or throttling and any change may affect what winners pay. This paper…

应用统计 · 统计学 2016-05-31 Guillaume W. Basse , Hossein Azari Soufiani , Diane Lambert

Over the past decade, many dealers have implemented algorithmic models to automatically respond to RFQs and manage flows originating from their electronic platforms. In parallel, building on the foundational work of Ho and Stoll, and later…

交易与市场微观结构 · 定量金融 2025-11-18 Alexander Barzykin , Philippe Bergault , Olivier Guéant , Malo Lemmel

We study the design of mechanisms in combinatorial auction domains. We focus on settings where the auction is repeated, motivated by auctions for licenses or advertising space. We consider models of agent behaviour in which they either…

计算机科学与博弈论 · 计算机科学 2009-10-01 Brendan Lucier

Reinforcement learning studies how to balance exploration and exploitation in real-world systems, optimizing interactions with the world while simultaneously learning how the world operates. One general class of algorithms for such learning…

机器学习 · 统计学 2018-08-10 Iñigo Urteaga , Chris H. Wiggins