AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Online Bilateral Trade With Minimal Feedback: Don’t Waste Seller’s Time

Francesco Bacchiocchi, Matteo Castiglioni, Roberto Colomboni, Alberto Marchesi

NeurIPS 2025 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes an asynchronous two-bit feedback model for online bilateral trade that avoids querying the seller when the buyer has already rejected the offer, reducing wasted seller time.

Problem

Online learning of optimal bilateral trade mechanisms under two-bit feedback, where prior synchronous models query both buyer and seller even when the buyer rejects, offering a trade to the seller unnecessarily.

Approach

An asynchronous two-bit feedback model in which the seller is queried only after the buyer accepts the price, so no seller time is wasted on rejected offers; the abstract is truncated, so the exact algorithmic details are not stated.

Experimental setup

Builds on: two-bit feedback bilateral trade model

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy