{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3LYYXDQOGA4E4QJLWOTABB4E6Y","short_pith_number":"pith:3LYYXDQO","schema_version":"1.0","canonical_sha256":"daf18b8e0e30384e412bb3a6008784f63a243cd3107b7b95b08b0423e0141302","source":{"kind":"arxiv","id":"1301.2276","version":1},"attestation_state":"computed","paper":{"title":"A Dynamic Programming Model for Determining Bidding Strategies in Sequential Auctions: Quasi-linear Utility and Budget Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hiromitsu Hattori, Makoto Yokoo, Toramatsu Shintani, Yuko Sakurai","submitted_at":"2013-01-10T16:24:02Z","abstract_excerpt":"In this paper, we develop a new method for finding an optimal biddingstrategy in sequential auctions, using a dynamic programming technique. Theexisting method assumes that the utility of a user is represented in anadditive form. Thus, the remaining endowment of money must be explicitlyrepresented in each state, and the calculation of the optimal biddingstrategy becomes time-consuming when the initial endowment of money mbecomes large.In this paper, we develop a new problem formalization that avoids explicitlyrepresenting the remaining endowment, by assuming the utility of a user canbe represe"},"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":"1301.2276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-01-10T16:24:02Z","cross_cats_sorted":[],"title_canon_sha256":"ec7c5b1f9dd7db9bc52b78c58d4a3d19d65f1ea63f7af03c6916b302b1759e5d","abstract_canon_sha256":"124788b28aa0d717eec48c986d95d7df5f9c7880637a0887784bf796ff08b06c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:45.661698Z","signature_b64":"l6bqF4oRRe8rR0saR98OcqI7C4PN8/TFVvOV3GL0sRwHBY/Zsr2y4bGqW7oSs70JkRjgYzgmOHf0AYgf8+1KCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daf18b8e0e30384e412bb3a6008784f63a243cd3107b7b95b08b0423e0141302","last_reissued_at":"2026-05-18T03:36:45.661123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:45.661123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dynamic Programming Model for Determining Bidding Strategies in Sequential Auctions: Quasi-linear Utility and Budget Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hiromitsu Hattori, Makoto Yokoo, Toramatsu Shintani, Yuko Sakurai","submitted_at":"2013-01-10T16:24:02Z","abstract_excerpt":"In this paper, we develop a new method for finding an optimal biddingstrategy in sequential auctions, using a dynamic programming technique. Theexisting method assumes that the utility of a user is represented in anadditive form. Thus, the remaining endowment of money must be explicitlyrepresented in each state, and the calculation of the optimal biddingstrategy becomes time-consuming when the initial endowment of money mbecomes large.In this paper, we develop a new problem formalization that avoids explicitlyrepresenting the remaining endowment, by assuming the utility of a user canbe represe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2276","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":"1301.2276","created_at":"2026-05-18T03:36:45.661216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2276v1","created_at":"2026-05-18T03:36:45.661216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2276","created_at":"2026-05-18T03:36:45.661216+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LYYXDQOGA4E","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LYYXDQOGA4E4QJL","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LYYXDQO","created_at":"2026-05-18T12:27:32.513160+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/3LYYXDQOGA4E4QJLWOTABB4E6Y","json":"https://pith.science/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y.json","graph_json":"https://pith.science/api/pith-number/3LYYXDQOGA4E4QJLWOTABB4E6Y/graph.json","events_json":"https://pith.science/api/pith-number/3LYYXDQOGA4E4QJLWOTABB4E6Y/events.json","paper":"https://pith.science/paper/3LYYXDQO"},"agent_actions":{"view_html":"https://pith.science/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y","download_json":"https://pith.science/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y.json","view_paper":"https://pith.science/paper/3LYYXDQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2276&json=true","fetch_graph":"https://pith.science/api/pith-number/3LYYXDQOGA4E4QJLWOTABB4E6Y/graph.json","fetch_events":"https://pith.science/api/pith-number/3LYYXDQOGA4E4QJLWOTABB4E6Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y/action/storage_attestation","attest_author":"https://pith.science/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y/action/author_attestation","sign_citation":"https://pith.science/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y/action/citation_signature","submit_replication":"https://pith.science/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y/action/replication_record"}},"created_at":"2026-05-18T03:36:45.661216+00:00","updated_at":"2026-05-18T03:36:45.661216+00:00"}