{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZSCJKSWKOIXYV7GO7MZ5TB2LAM","short_pith_number":"pith:ZSCJKSWK","schema_version":"1.0","canonical_sha256":"cc84954aca722f8afccefb33d9874b033ae699df4dad9b2d5a7e1c6182365c7a","source":{"kind":"arxiv","id":"1508.01130","version":1},"attestation_state":"computed","paper":{"title":"On the Efficiency of All-Pay Mechanisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alkmini Sgouritsa, Bo Tang, George Christodoulou","submitted_at":"2015-08-05T17:03:05Z","abstract_excerpt":"We study the inefficiency of mixed equilibria, expressed as the price of anarchy, of all-pay auctions in three different environments: combinatorial, multi-unit and single-item auctions. First, we consider item-bidding combinatorial auctions where m all-pay auctions run in parallel, one for each good. For fractionally subadditive valuations, we strengthen the upper bound from 2 [Syrgkanis and Tardos STOC'13] to 1.82 by proving some structural properties that characterize the mixed Nash equilibria of the game. Next, we design an all-pay mechanism with a randomized allocation rule for the multi-"},"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":"1508.01130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-05T17:03:05Z","cross_cats_sorted":[],"title_canon_sha256":"5cb607914b57639d05cdf216109e9c1729cb9096bf906e5f72a9d94ca5b1e5d7","abstract_canon_sha256":"f0b9c4c9754d844b38a47a04d5a4f04de94d03187a2680415481066f6a00c243"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:43.987757Z","signature_b64":"fQwz2rkB720KW/WrySBW8FR1eNkXRFSHom2A71IeS9coln/qriqGs5YG4K+AMSMHT15363C2p4T1Eb1nI/+ZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc84954aca722f8afccefb33d9874b033ae699df4dad9b2d5a7e1c6182365c7a","last_reissued_at":"2026-05-18T01:35:43.987362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:43.987362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Efficiency of All-Pay Mechanisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alkmini Sgouritsa, Bo Tang, George Christodoulou","submitted_at":"2015-08-05T17:03:05Z","abstract_excerpt":"We study the inefficiency of mixed equilibria, expressed as the price of anarchy, of all-pay auctions in three different environments: combinatorial, multi-unit and single-item auctions. First, we consider item-bidding combinatorial auctions where m all-pay auctions run in parallel, one for each good. For fractionally subadditive valuations, we strengthen the upper bound from 2 [Syrgkanis and Tardos STOC'13] to 1.82 by proving some structural properties that characterize the mixed Nash equilibria of the game. Next, we design an all-pay mechanism with a randomized allocation rule for the multi-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01130","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":"1508.01130","created_at":"2026-05-18T01:35:43.987425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.01130v1","created_at":"2026-05-18T01:35:43.987425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01130","created_at":"2026-05-18T01:35:43.987425+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZSCJKSWKOIXY","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZSCJKSWKOIXYV7GO","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZSCJKSWK","created_at":"2026-05-18T12:29:52.810259+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/ZSCJKSWKOIXYV7GO7MZ5TB2LAM","json":"https://pith.science/pith/ZSCJKSWKOIXYV7GO7MZ5TB2LAM.json","graph_json":"https://pith.science/api/pith-number/ZSCJKSWKOIXYV7GO7MZ5TB2LAM/graph.json","events_json":"https://pith.science/api/pith-number/ZSCJKSWKOIXYV7GO7MZ5TB2LAM/events.json","paper":"https://pith.science/paper/ZSCJKSWK"},"agent_actions":{"view_html":"https://pith.science/pith/ZSCJKSWKOIXYV7GO7MZ5TB2LAM","download_json":"https://pith.science/pith/ZSCJKSWKOIXYV7GO7MZ5TB2LAM.json","view_paper":"https://pith.science/paper/ZSCJKSWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.01130&json=true","fetch_graph":"https://pith.science/api/pith-number/ZSCJKSWKOIXYV7GO7MZ5TB2LAM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZSCJKSWKOIXYV7GO7MZ5TB2LAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZSCJKSWKOIXYV7GO7MZ5TB2LAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZSCJKSWKOIXYV7GO7MZ5TB2LAM/action/storage_attestation","attest_author":"https://pith.science/pith/ZSCJKSWKOIXYV7GO7MZ5TB2LAM/action/author_attestation","sign_citation":"https://pith.science/pith/ZSCJKSWKOIXYV7GO7MZ5TB2LAM/action/citation_signature","submit_replication":"https://pith.science/pith/ZSCJKSWKOIXYV7GO7MZ5TB2LAM/action/replication_record"}},"created_at":"2026-05-18T01:35:43.987425+00:00","updated_at":"2026-05-18T01:35:43.987425+00:00"}