{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CEAUZAF65BBIL6LAL5HOUZP3CD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f1625b90c655c2e0cc24d3b4399ba5411df647a1623386f87b38c5de34747097","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-21T21:16:22Z","title_canon_sha256":"f2a5a265eaba8ef3e0fe9c0341a1e309848a5a2ce383e07f6d12cc4a879d9e81"},"schema_version":"1.0","source":{"id":"1906.09331","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09331","created_at":"2026-05-17T23:42:38Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09331v1","created_at":"2026-05-17T23:42:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09331","created_at":"2026-05-17T23:42:38Z"},{"alias_kind":"pith_short_12","alias_value":"CEAUZAF65BBI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"CEAUZAF65BBIL6LA","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"CEAUZAF6","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:6412dc54c898e22e2dbf3a987f57b0217bc0d7357828b7e12eb6812eb914169d","target":"graph","created_at":"2026-05-17T23:42:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexey Drutsa","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-21T21:16:22Z","title":"Reserve Pricing in Repeated Second-Price Auctions with Strategic Bidders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09331","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e62f30108acc847e5492c9ebc96cdcf39dedade564c0abc8f54d6886f0f9c9e0","target":"record","created_at":"2026-05-17T23:42:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f1625b90c655c2e0cc24d3b4399ba5411df647a1623386f87b38c5de34747097","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-21T21:16:22Z","title_canon_sha256":"f2a5a265eaba8ef3e0fe9c0341a1e309848a5a2ce383e07f6d12cc4a879d9e81"},"schema_version":"1.0","source":{"id":"1906.09331","kind":"arxiv","version":1}},"canonical_sha256":"11014c80bee84285f9605f4eea65fb10d9f251aa4a731052444c5139eaeaede7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11014c80bee84285f9605f4eea65fb10d9f251aa4a731052444c5139eaeaede7","first_computed_at":"2026-05-17T23:42:38.461955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:38.461955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g6yiZmO6mOCnthBuyidMYIsB4sQrtruUvmwuYcVvPz2OltsqmhoMn6wszgW4VuVFnTWVHiQCUYxwDsVNButiCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:38.462585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.09331","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e62f30108acc847e5492c9ebc96cdcf39dedade564c0abc8f54d6886f0f9c9e0","sha256:6412dc54c898e22e2dbf3a987f57b0217bc0d7357828b7e12eb6812eb914169d"],"state_sha256":"04657fe9644f15ba8218dcc1019a145b7ce17de758cd03e5770956c273f31858"}