{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:T4VDMK5Y7DTUSKXGYJEN64YB36","short_pith_number":"pith:T4VDMK5Y","schema_version":"1.0","canonical_sha256":"9f2a362bb8f8e7492ae6c248df7301dfbfeffd4bd125ca992a5cfac6ecb25b43","source":{"kind":"arxiv","id":"1805.02574","version":1},"attestation_state":"computed","paper":{"title":"Optimal Pricing in Repeated Posted-Price Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alexey Drutsa, Arsenii Vanunts","submitted_at":"2018-05-07T15:30:54Z","abstract_excerpt":"We study revenue optimization pricing algorithms for repeated posted-price auctions where a seller interacts with a single strategic buyer that holds a fixed private valuation. We show that, in the case when both the seller and the buyer have the same discounting in their cumulative utilities (revenue and surplus), there exist two optimal algorithms. The first one constantly offers the Myerson price, while the second pricing proposes a \"big deal\": pay for all goods in advance (at the first round) or get nothing. However, when there is an imbalance between the seller and the buyer in the patien"},"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":"1805.02574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-05-07T15:30:54Z","cross_cats_sorted":[],"title_canon_sha256":"87fb18cb59fa613ff3262c961ca09bba251b5238503fd548b8cb68d9904f2c5b","abstract_canon_sha256":"9f915d0ab41c5a0a391e954665564902f317901ca5f729887f2586c4159a1f05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:39.615112Z","signature_b64":"pc7EGZdS7h2EqKhMBG+46BlqXeQkcCJCtPGtKku/X1QO4KIqjgV7HP0E4ft4OS3sSQTvIOX9E2iqzSYqY56TAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f2a362bb8f8e7492ae6c248df7301dfbfeffd4bd125ca992a5cfac6ecb25b43","last_reissued_at":"2026-05-18T00:16:39.614668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:39.614668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Pricing in Repeated Posted-Price Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alexey Drutsa, Arsenii Vanunts","submitted_at":"2018-05-07T15:30:54Z","abstract_excerpt":"We study revenue optimization pricing algorithms for repeated posted-price auctions where a seller interacts with a single strategic buyer that holds a fixed private valuation. We show that, in the case when both the seller and the buyer have the same discounting in their cumulative utilities (revenue and surplus), there exist two optimal algorithms. The first one constantly offers the Myerson price, while the second pricing proposes a \"big deal\": pay for all goods in advance (at the first round) or get nothing. However, when there is an imbalance between the seller and the buyer in the patien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02574","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":"1805.02574","created_at":"2026-05-18T00:16:39.614734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02574v1","created_at":"2026-05-18T00:16:39.614734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02574","created_at":"2026-05-18T00:16:39.614734+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4VDMK5Y7DTU","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4VDMK5Y7DTUSKXG","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4VDMK5Y","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09331","citing_title":"Reserve Pricing in Repeated Second-Price Auctions with Strategic Bidders","ref_index":71,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T4VDMK5Y7DTUSKXGYJEN64YB36","json":"https://pith.science/pith/T4VDMK5Y7DTUSKXGYJEN64YB36.json","graph_json":"https://pith.science/api/pith-number/T4VDMK5Y7DTUSKXGYJEN64YB36/graph.json","events_json":"https://pith.science/api/pith-number/T4VDMK5Y7DTUSKXGYJEN64YB36/events.json","paper":"https://pith.science/paper/T4VDMK5Y"},"agent_actions":{"view_html":"https://pith.science/pith/T4VDMK5Y7DTUSKXGYJEN64YB36","download_json":"https://pith.science/pith/T4VDMK5Y7DTUSKXGYJEN64YB36.json","view_paper":"https://pith.science/paper/T4VDMK5Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02574&json=true","fetch_graph":"https://pith.science/api/pith-number/T4VDMK5Y7DTUSKXGYJEN64YB36/graph.json","fetch_events":"https://pith.science/api/pith-number/T4VDMK5Y7DTUSKXGYJEN64YB36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4VDMK5Y7DTUSKXGYJEN64YB36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4VDMK5Y7DTUSKXGYJEN64YB36/action/storage_attestation","attest_author":"https://pith.science/pith/T4VDMK5Y7DTUSKXGYJEN64YB36/action/author_attestation","sign_citation":"https://pith.science/pith/T4VDMK5Y7DTUSKXGYJEN64YB36/action/citation_signature","submit_replication":"https://pith.science/pith/T4VDMK5Y7DTUSKXGYJEN64YB36/action/replication_record"}},"created_at":"2026-05-18T00:16:39.614734+00:00","updated_at":"2026-05-18T00:16:39.614734+00:00"}