{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3Z24LLW2VEOGD55GID4C4THXI4","short_pith_number":"pith:3Z24LLW2","schema_version":"1.0","canonical_sha256":"de75c5aedaa91c61f7a640f82e4cf7472aa05dae496d62453a9b854f22bdd9b2","source":{"kind":"arxiv","id":"1904.12422","version":1},"attestation_state":"computed","paper":{"title":"Efficiency in Truthful Auctions via a Social Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"econ.TH","authors_text":"Makoto Yokoo, Seiji Takanashi, Taiki Todo, Takehiro Kawasaki","submitted_at":"2019-04-29T02:17:38Z","abstract_excerpt":"In this paper, we study efficiency in truthful auctions via a social network, where a seller can only spread the information of an auction to the buyers through the buyers' network. In single-item auctions, we show that no mechanism is strategy-proof, individually rational, efficient, and weakly budget balanced. In addition, we propose $\\alpha$-APG mechanisms, a class of mechanisms which operate a trade-off between efficiency and weakly budget balancedness. In multi-item auctions, there already exists a strategy-proof mechanism when all buyers need only one item. However, we indicate a counter"},"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":"1904.12422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2019-04-29T02:17:38Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"032e487c6fafc3faff9e6ed5f5afd6f219746da789930c3b21ec82664f59babe","abstract_canon_sha256":"d943af5227515dcebc552e51c4f183c435ae366148345166fc4d0e1118783363"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:35.217134Z","signature_b64":"IHkY/H6C8tw8hpueBNZpScb5WTEBpMf5rz4ZGW8cBDifW/6Nz/fja/nVaBsvV24bDhHDpX13yCGgp2VjVJfZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de75c5aedaa91c61f7a640f82e4cf7472aa05dae496d62453a9b854f22bdd9b2","last_reissued_at":"2026-05-17T23:47:35.216665Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:35.216665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiency in Truthful Auctions via a Social Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"econ.TH","authors_text":"Makoto Yokoo, Seiji Takanashi, Taiki Todo, Takehiro Kawasaki","submitted_at":"2019-04-29T02:17:38Z","abstract_excerpt":"In this paper, we study efficiency in truthful auctions via a social network, where a seller can only spread the information of an auction to the buyers through the buyers' network. In single-item auctions, we show that no mechanism is strategy-proof, individually rational, efficient, and weakly budget balanced. In addition, we propose $\\alpha$-APG mechanisms, a class of mechanisms which operate a trade-off between efficiency and weakly budget balancedness. In multi-item auctions, there already exists a strategy-proof mechanism when all buyers need only one item. However, we indicate a counter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12422","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":"1904.12422","created_at":"2026-05-17T23:47:35.216745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.12422v1","created_at":"2026-05-17T23:47:35.216745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12422","created_at":"2026-05-17T23:47:35.216745+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Z24LLW2VEOG","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Z24LLW2VEOGD55G","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Z24LLW2","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.17221","citing_title":"Probabilistic Mechanism Design in Diffusion Auctions","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3Z24LLW2VEOGD55GID4C4THXI4","json":"https://pith.science/pith/3Z24LLW2VEOGD55GID4C4THXI4.json","graph_json":"https://pith.science/api/pith-number/3Z24LLW2VEOGD55GID4C4THXI4/graph.json","events_json":"https://pith.science/api/pith-number/3Z24LLW2VEOGD55GID4C4THXI4/events.json","paper":"https://pith.science/paper/3Z24LLW2"},"agent_actions":{"view_html":"https://pith.science/pith/3Z24LLW2VEOGD55GID4C4THXI4","download_json":"https://pith.science/pith/3Z24LLW2VEOGD55GID4C4THXI4.json","view_paper":"https://pith.science/paper/3Z24LLW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.12422&json=true","fetch_graph":"https://pith.science/api/pith-number/3Z24LLW2VEOGD55GID4C4THXI4/graph.json","fetch_events":"https://pith.science/api/pith-number/3Z24LLW2VEOGD55GID4C4THXI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Z24LLW2VEOGD55GID4C4THXI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Z24LLW2VEOGD55GID4C4THXI4/action/storage_attestation","attest_author":"https://pith.science/pith/3Z24LLW2VEOGD55GID4C4THXI4/action/author_attestation","sign_citation":"https://pith.science/pith/3Z24LLW2VEOGD55GID4C4THXI4/action/citation_signature","submit_replication":"https://pith.science/pith/3Z24LLW2VEOGD55GID4C4THXI4/action/replication_record"}},"created_at":"2026-05-17T23:47:35.216745+00:00","updated_at":"2026-05-17T23:47:35.216745+00:00"}