Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-15T15:56:33.458689Z
Paper Citation Record · LEDGER
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade
As of 17 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 2 inbound Pith citation observations for arXiv:2509.22563.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-14T04:18:58.078642Z
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
14 of 14 outbound references displayed
- verified exact0
- verified fuzzy13
- unresolved1
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation cd1e846a-2e4a-4a0e-9d31-9256037bef3a · outbound
This paper cites A tight VC-dimension analysis of clustering coresets with applications.
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade A tight VC-dimension analysis of clustering coresets with applications
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T15:56:33.689766Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 9b309843-974d-450d-8a38-7be8df43d86f · outbound
This paper cites Learning to bid without knowing your value.
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade Learning to bid without knowing your value
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T15:56:33.633355Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation d4dd6fee-7eff-45b0-8e97-ec61657c5cff · outbound
This paper cites Generalizing complex hypotheses on product distributions: Auctions, prophet inequalities, and pandora’s problem.
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade Generalizing complex hypotheses on product distributions: Auctions, prophet inequalities, and pandora’s problem
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T15:56:33.599458Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 0abf5866-f697-4aaf-8697-72a7a9a2d14c · outbound
This paper cites characterize.
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade characterize
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T15:56:33.531542Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 95b46577-773d-44df-81ad-536b34089f6b · outbound
This paper cites left” and “right.
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade left” and “right
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T15:56:33.497143Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 49827bf3-fae5-4d39-b277-8d0f44c349af · outbound
This paper cites an unresolved cited work.
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade Unresolved cited work
Reference 1961
- Resolution
- unresolved
- raw_fallback, observed 2026-08-15T15:56:33.547943Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 5541a5ec-3c29-4884-ac8f-1ca1348d68c5 · outbound
This paper cites In particular, the first mechanism to achieve a constant factor approximation of the optimal gain from trade in the Bayesian setting [Deng et al., 2022] is BIC but not DSIC.
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade In particular, the first mechanism to achieve a constant factor approximation of the optimal gain from trade in the Bayesian setting [Deng et al., 2022] is BIC but not DSIC
Reference 1983
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T15:56:33.515094Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 840c802c-ece3-48af-9ea2-4db85b408c3e · outbound
This paper cites On the pseudo-dimension of nearly optimal auctions.
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade On the pseudo-dimension of nearly optimal auctions
Reference 2008
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T15:56:33.564559Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 4d2ad8c3-249e-4a29-b5bb-59178b681a2d · outbound
This paper cites Smoothed analysis of online non- parametric auctions.
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade Smoothed analysis of online non- parametric auctions
Reference 2009
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T15:56:33.666550Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 6f6dc25d-aff1-4159-8451-4f6c7b14e1c6 · outbound
This paper cites Bandit algorithms for prophet inequality and pandora’s box.
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade Bandit algorithms for prophet inequality and pandora’s box
Reference 2018
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T15:56:33.616192Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation d50e8100-e3d5-4b07-8a28-4db67a2d94b2 · outbound
This paper cites Kleinberg and Frank Thomson Leighton.
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade Kleinberg and Frank Thomson Leighton
Reference 2019
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T15:56:33.582348Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 2947d03f-142a-4868-b333-6804697e3ee2 · outbound
This paper cites Optimal no-regret learning for one-sided lipschitz functions.
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade Optimal no-regret learning for one-sided lipschitz functions
Reference 2021
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T15:56:33.649757Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 4a8a96ee-aabf-4143-a7b6-41d68b800ef6 · outbound
This paper cites Online learning in online auctions.
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade Online learning in online auctions
Reference 2022
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T15:56:33.722521Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 0c636b23-9183-4fb8-b003-41ffadcc2ade · outbound
This paper cites On multi-dimensional gains from trade maximization.
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade On multi-dimensional gains from trade maximization
Reference 2023
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T15:56:33.706597Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Pith citing papers
Observation 974f0ea7-289f-4767-bb26-605c7d8c8fe5 · inbound
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs cites this paper.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade
Reference 26
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:55.393364Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4a7fb64b-4e17-4711-8698-dac8eb762c35 · inbound
TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability cites this paper.
TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade
Reference 50
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T04:18:58.078642Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.