{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CEAUZAF65BBIL6LAL5HOUZP3CD","short_pith_number":"pith:CEAUZAF6","schema_version":"1.0","canonical_sha256":"11014c80bee84285f9605f4eea65fb10d9f251aa4a731052444c5139eaeaede7","source":{"kind":"arxiv","id":"1906.09331","version":1},"attestation_state":"computed","paper":{"title":"Reserve Pricing in Repeated Second-Price Auctions with Strategic Bidders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.GT","authors_text":"Alexey Drutsa","submitted_at":"2019-06-21T21:16:22Z","abstract_excerpt":"We study revenue optimization learning algorithms for repeated second-price auctions with reserve where a seller interacts with multiple strategic bidders each of which holds a fixed private valuation for a good and seeks to maximize his expected future cumulative discounted surplus. We propose a novel algorithm that has strategic regret upper bound of $O(\\log\\log T)$ for worst-case valuations. This pricing is based on our novel transformation that upgrades an algorithm designed for the setup with a single buyer to the multi-buyer case. We provide theoretical guarantees on the ability of a tra"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1906.09331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-21T21:16:22Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"f2a5a265eaba8ef3e0fe9c0341a1e309848a5a2ce383e07f6d12cc4a879d9e81","abstract_canon_sha256":"f1625b90c655c2e0cc24d3b4399ba5411df647a1623386f87b38c5de34747097"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:38.462585Z","signature_b64":"g6yiZmO6mOCnthBuyidMYIsB4sQrtruUvmwuYcVvPz2OltsqmhoMn6wszgW4VuVFnTWVHiQCUYxwDsVNButiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11014c80bee84285f9605f4eea65fb10d9f251aa4a731052444c5139eaeaede7","last_reissued_at":"2026-05-17T23:42:38.461955Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:38.461955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reserve Pricing in Repeated Second-Price Auctions with Strategic Bidders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.GT","authors_text":"Alexey Drutsa","submitted_at":"2019-06-21T21:16:22Z","abstract_excerpt":"We study revenue optimization learning algorithms for repeated second-price auctions with reserve where a seller interacts with multiple strategic bidders each of which holds a fixed private valuation for a good and seeks to maximize his expected future cumulative discounted surplus. We propose a novel algorithm that has strategic regret upper bound of $O(\\log\\log T)$ for worst-case valuations. This pricing is based on our novel transformation that upgrades an algorithm designed for the setup with a single buyer to the multi-buyer case. We provide theoretical guarantees on the ability of a tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09331","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.09331","created_at":"2026-05-17T23:42:38.462048+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.09331v1","created_at":"2026-05-17T23:42:38.462048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09331","created_at":"2026-05-17T23:42:38.462048+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEAUZAF65BBI","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEAUZAF65BBIL6LA","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEAUZAF6","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CEAUZAF65BBIL6LAL5HOUZP3CD","json":"https://pith.science/pith/CEAUZAF65BBIL6LAL5HOUZP3CD.json","graph_json":"https://pith.science/api/pith-number/CEAUZAF65BBIL6LAL5HOUZP3CD/graph.json","events_json":"https://pith.science/api/pith-number/CEAUZAF65BBIL6LAL5HOUZP3CD/events.json","paper":"https://pith.science/paper/CEAUZAF6"},"agent_actions":{"view_html":"https://pith.science/pith/CEAUZAF65BBIL6LAL5HOUZP3CD","download_json":"https://pith.science/pith/CEAUZAF65BBIL6LAL5HOUZP3CD.json","view_paper":"https://pith.science/paper/CEAUZAF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.09331&json=true","fetch_graph":"https://pith.science/api/pith-number/CEAUZAF65BBIL6LAL5HOUZP3CD/graph.json","fetch_events":"https://pith.science/api/pith-number/CEAUZAF65BBIL6LAL5HOUZP3CD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEAUZAF65BBIL6LAL5HOUZP3CD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEAUZAF65BBIL6LAL5HOUZP3CD/action/storage_attestation","attest_author":"https://pith.science/pith/CEAUZAF65BBIL6LAL5HOUZP3CD/action/author_attestation","sign_citation":"https://pith.science/pith/CEAUZAF65BBIL6LAL5HOUZP3CD/action/citation_signature","submit_replication":"https://pith.science/pith/CEAUZAF65BBIL6LAL5HOUZP3CD/action/replication_record"}},"created_at":"2026-05-17T23:42:38.462048+00:00","updated_at":"2026-05-17T23:42:38.462048+00:00"}