{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:22Y4IW5FKLUSCOT5RVP5YGNSSI","short_pith_number":"pith:22Y4IW5F","schema_version":"1.0","canonical_sha256":"d6b1c45ba552e9213a7d8d5fdc19b29232b4cfd4130421fa8b4200bda3280892","source":{"kind":"arxiv","id":"1804.11060","version":1},"attestation_state":"computed","paper":{"title":"Learning Optimal Reserve Price against Non-myopic Bidders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jinyan Liu, Xiangning Wang, Zhiyi Huang","submitted_at":"2018-04-30T06:54:05Z","abstract_excerpt":"We consider the problem of learning optimal reserve price in repeated auctions against non-myopic bidders, who may bid strategically in order to gain in future rounds even if the single-round auctions are truthful. Previous algorithms, e.g., empirical pricing, do not provide non-trivial regret rounds in this setting in general. We introduce algorithms that obtain small regret against non-myopic bidders either when the market is large, i.e., no bidder appears in a constant fraction of the rounds, or when the bidders are impatient, i.e., they discount future utility by some factor mildly bounded"},"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":"1804.11060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-04-30T06:54:05Z","cross_cats_sorted":[],"title_canon_sha256":"fdd342e96d24b5a1b9afd264efa4ba0c460517996d47ded3ed415708814a566c","abstract_canon_sha256":"8d3f4443763aec4a21b34cf68eebdb1406431e32b9adadabc434820293df59e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:14.743409Z","signature_b64":"jnPvK57wjdFWjYOnG9wRkOKwBMeH9rBNIaSrm8zRbnAHsLD0OO9b8mnyPMQPuhUHS1NzAcuj4wiaOUlTvezVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6b1c45ba552e9213a7d8d5fdc19b29232b4cfd4130421fa8b4200bda3280892","last_reissued_at":"2026-05-18T00:17:14.742737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:14.742737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Optimal Reserve Price against Non-myopic Bidders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jinyan Liu, Xiangning Wang, Zhiyi Huang","submitted_at":"2018-04-30T06:54:05Z","abstract_excerpt":"We consider the problem of learning optimal reserve price in repeated auctions against non-myopic bidders, who may bid strategically in order to gain in future rounds even if the single-round auctions are truthful. Previous algorithms, e.g., empirical pricing, do not provide non-trivial regret rounds in this setting in general. We introduce algorithms that obtain small regret against non-myopic bidders either when the market is large, i.e., no bidder appears in a constant fraction of the rounds, or when the bidders are impatient, i.e., they discount future utility by some factor mildly bounded"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11060","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":"1804.11060","created_at":"2026-05-18T00:17:14.742822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.11060v1","created_at":"2026-05-18T00:17:14.742822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11060","created_at":"2026-05-18T00:17:14.742822+00:00"},{"alias_kind":"pith_short_12","alias_value":"22Y4IW5FKLUS","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"22Y4IW5FKLUSCOT5","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"22Y4IW5F","created_at":"2026-05-18T12:31:59.375834+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/22Y4IW5FKLUSCOT5RVP5YGNSSI","json":"https://pith.science/pith/22Y4IW5FKLUSCOT5RVP5YGNSSI.json","graph_json":"https://pith.science/api/pith-number/22Y4IW5FKLUSCOT5RVP5YGNSSI/graph.json","events_json":"https://pith.science/api/pith-number/22Y4IW5FKLUSCOT5RVP5YGNSSI/events.json","paper":"https://pith.science/paper/22Y4IW5F"},"agent_actions":{"view_html":"https://pith.science/pith/22Y4IW5FKLUSCOT5RVP5YGNSSI","download_json":"https://pith.science/pith/22Y4IW5FKLUSCOT5RVP5YGNSSI.json","view_paper":"https://pith.science/paper/22Y4IW5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.11060&json=true","fetch_graph":"https://pith.science/api/pith-number/22Y4IW5FKLUSCOT5RVP5YGNSSI/graph.json","fetch_events":"https://pith.science/api/pith-number/22Y4IW5FKLUSCOT5RVP5YGNSSI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22Y4IW5FKLUSCOT5RVP5YGNSSI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22Y4IW5FKLUSCOT5RVP5YGNSSI/action/storage_attestation","attest_author":"https://pith.science/pith/22Y4IW5FKLUSCOT5RVP5YGNSSI/action/author_attestation","sign_citation":"https://pith.science/pith/22Y4IW5FKLUSCOT5RVP5YGNSSI/action/citation_signature","submit_replication":"https://pith.science/pith/22Y4IW5FKLUSCOT5RVP5YGNSSI/action/replication_record"}},"created_at":"2026-05-18T00:17:14.742822+00:00","updated_at":"2026-05-18T00:17:14.742822+00:00"}