{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ALG22LV3FWZB2J6JS5IONEAGAN","short_pith_number":"pith:ALG22LV3","schema_version":"1.0","canonical_sha256":"02cdad2ebb2db21d27c99750e6900603470ed3c86f739d2de9d56915d7a11de6","source":{"kind":"arxiv","id":"1207.1360","version":1},"attestation_state":"computed","paper":{"title":"Models for Truthful Online Double Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"David C. Parkes, Jonathan Bredin","submitted_at":"2012-07-04T16:02:21Z","abstract_excerpt":"Online double auctions (DAs) model a dynamic two-sided matching problem with private information and self-interest, and are relevant for dynamic resource and task allocation problems. We present a general method to design truthful DAs, such that no agent can benefit from misreporting its arrival time, duration, or value. The family of DAs is parameterized by a pricing rule, and includes a generalization of McAfee's truthful DA to this dynamic setting. We present an empirical study, in which we study the allocative-surplus and agent surplus for a number of different DAs. Our results illustrate "},"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":"1207.1360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-04T16:02:21Z","cross_cats_sorted":[],"title_canon_sha256":"ff2558ec18dc0f2a9e6bce851c8694873e1046894ac913b6753b91faafc57537","abstract_canon_sha256":"50e1e7aee74836dcc22392b956f4f5a0fae14fdf6726f1cc8b057cc764e05a83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:37.666058Z","signature_b64":"XVb8XYiKCmsH/ypo2NgYWQ6n79faY1FvHAvTRxsYWTLavPmAJgxmQkuVly7pOZkrGYLXjzmfdgdZMAnX6izyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02cdad2ebb2db21d27c99750e6900603470ed3c86f739d2de9d56915d7a11de6","last_reissued_at":"2026-05-18T03:51:37.665340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:37.665340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Models for Truthful Online Double Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"David C. Parkes, Jonathan Bredin","submitted_at":"2012-07-04T16:02:21Z","abstract_excerpt":"Online double auctions (DAs) model a dynamic two-sided matching problem with private information and self-interest, and are relevant for dynamic resource and task allocation problems. We present a general method to design truthful DAs, such that no agent can benefit from misreporting its arrival time, duration, or value. The family of DAs is parameterized by a pricing rule, and includes a generalization of McAfee's truthful DA to this dynamic setting. We present an empirical study, in which we study the allocative-surplus and agent surplus for a number of different DAs. Our results illustrate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1360","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":"1207.1360","created_at":"2026-05-18T03:51:37.665450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1360v1","created_at":"2026-05-18T03:51:37.665450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1360","created_at":"2026-05-18T03:51:37.665450+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALG22LV3FWZB","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALG22LV3FWZB2J6J","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALG22LV3","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.22241","citing_title":"TRUST-SC: Truthful Multi-Task Double Auction for Quality-Aware Spatial Crowdsourcing in Strategic Environment","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ALG22LV3FWZB2J6JS5IONEAGAN","json":"https://pith.science/pith/ALG22LV3FWZB2J6JS5IONEAGAN.json","graph_json":"https://pith.science/api/pith-number/ALG22LV3FWZB2J6JS5IONEAGAN/graph.json","events_json":"https://pith.science/api/pith-number/ALG22LV3FWZB2J6JS5IONEAGAN/events.json","paper":"https://pith.science/paper/ALG22LV3"},"agent_actions":{"view_html":"https://pith.science/pith/ALG22LV3FWZB2J6JS5IONEAGAN","download_json":"https://pith.science/pith/ALG22LV3FWZB2J6JS5IONEAGAN.json","view_paper":"https://pith.science/paper/ALG22LV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1360&json=true","fetch_graph":"https://pith.science/api/pith-number/ALG22LV3FWZB2J6JS5IONEAGAN/graph.json","fetch_events":"https://pith.science/api/pith-number/ALG22LV3FWZB2J6JS5IONEAGAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALG22LV3FWZB2J6JS5IONEAGAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALG22LV3FWZB2J6JS5IONEAGAN/action/storage_attestation","attest_author":"https://pith.science/pith/ALG22LV3FWZB2J6JS5IONEAGAN/action/author_attestation","sign_citation":"https://pith.science/pith/ALG22LV3FWZB2J6JS5IONEAGAN/action/citation_signature","submit_replication":"https://pith.science/pith/ALG22LV3FWZB2J6JS5IONEAGAN/action/replication_record"}},"created_at":"2026-05-18T03:51:37.665450+00:00","updated_at":"2026-05-18T03:51:37.665450+00:00"}