Pith. sign in

REVIEW 1 cited by

Optimal Real-Time Bidding Frameworks Discussion

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1602.01007 v1 pith:2ACENJ2N submitted 2016-02-02 cs.GT

Weinan Zhang , Kan Ren , Jun Wang This is my paper · ORCID
classification cs.GT
keywords biddingcostoptimalreal-timeadvertisingboundcomplementarydiscuss
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This note is a complementary material for the solution of optimal real-time bidding function in paper "Optimal Real-Time Bidding for Display Advertising, KDD 2014", where the estimated cost is taken as the bid price, i.e., the upper bound of the true cost. Here we discuss a more general bid optimisation framework with various utility and cost functions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. RTBAgent: A LLM-based Agent System for Real-Time Bidding

    cs.AI 2025-02 conditional novelty 5.0 of 10

    RTBAgent wraps an LLM around an expert bidding strategy, letting the model adjust a bid multiplier by up to ±50% using memories and daily reflection, and reports marginal click gains on iPinYou.

Pith tools