{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:42UH2MPZXMB3WLFUQQYBMDXPS6","short_pith_number":"pith:42UH2MPZ","schema_version":"1.0","canonical_sha256":"e6a87d31f9bb03bb2cb48430160eef97bc1c1d254006db43b0e11efe287376c1","source":{"kind":"arxiv","id":"1503.06244","version":1},"attestation_state":"computed","paper":{"title":"Games and Meta-Games: Pricing Rules for Combinatorial Mechanisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Benjamin Lubin","submitted_at":"2015-03-20T22:44:19Z","abstract_excerpt":"In settings where full incentive-compatibility is not available, such as core-constraint combinatorial auctions and budget-balanced combinatorial exchanges, we may wish to design mechanisms that are as incentive-compatible as possible. This paper offers a new characterization of approximate incentive-compatibility by casting the pricing problem as a meta-game between the center and the participating agents. Through a suitable set of simplifications, we describe the equilibrium of this game as a variational problem. We use this to characterize the space of optimal prices, enabling closed-form s"},"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":"1503.06244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-03-20T22:44:19Z","cross_cats_sorted":[],"title_canon_sha256":"76dd90cf35c34f9cbeff18fb19322b0459148be530b3176e3d5e95cb719a9bb2","abstract_canon_sha256":"bed095d0c400e0e713b88dba1a8943c93dd1ef4b6aba7a91d18d080e0ddc5f28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:38.979983Z","signature_b64":"M9KEJNghXHxwGoOwK3P+vEq1ZhSJgh6sCadmmtRQRHKMQ6QjCUtKN+OvxTGT9rOJYWiu8w9zFa7Sj7P0AIeCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6a87d31f9bb03bb2cb48430160eef97bc1c1d254006db43b0e11efe287376c1","last_reissued_at":"2026-05-18T02:20:38.979267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:38.979267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Games and Meta-Games: Pricing Rules for Combinatorial Mechanisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Benjamin Lubin","submitted_at":"2015-03-20T22:44:19Z","abstract_excerpt":"In settings where full incentive-compatibility is not available, such as core-constraint combinatorial auctions and budget-balanced combinatorial exchanges, we may wish to design mechanisms that are as incentive-compatible as possible. This paper offers a new characterization of approximate incentive-compatibility by casting the pricing problem as a meta-game between the center and the participating agents. Through a suitable set of simplifications, we describe the equilibrium of this game as a variational problem. We use this to characterize the space of optimal prices, enabling closed-form s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06244","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":"1503.06244","created_at":"2026-05-18T02:20:38.979369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06244v1","created_at":"2026-05-18T02:20:38.979369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06244","created_at":"2026-05-18T02:20:38.979369+00:00"},{"alias_kind":"pith_short_12","alias_value":"42UH2MPZXMB3","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"42UH2MPZXMB3WLFU","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"42UH2MPZ","created_at":"2026-05-18T12:29:02.477457+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/42UH2MPZXMB3WLFUQQYBMDXPS6","json":"https://pith.science/pith/42UH2MPZXMB3WLFUQQYBMDXPS6.json","graph_json":"https://pith.science/api/pith-number/42UH2MPZXMB3WLFUQQYBMDXPS6/graph.json","events_json":"https://pith.science/api/pith-number/42UH2MPZXMB3WLFUQQYBMDXPS6/events.json","paper":"https://pith.science/paper/42UH2MPZ"},"agent_actions":{"view_html":"https://pith.science/pith/42UH2MPZXMB3WLFUQQYBMDXPS6","download_json":"https://pith.science/pith/42UH2MPZXMB3WLFUQQYBMDXPS6.json","view_paper":"https://pith.science/paper/42UH2MPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06244&json=true","fetch_graph":"https://pith.science/api/pith-number/42UH2MPZXMB3WLFUQQYBMDXPS6/graph.json","fetch_events":"https://pith.science/api/pith-number/42UH2MPZXMB3WLFUQQYBMDXPS6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42UH2MPZXMB3WLFUQQYBMDXPS6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42UH2MPZXMB3WLFUQQYBMDXPS6/action/storage_attestation","attest_author":"https://pith.science/pith/42UH2MPZXMB3WLFUQQYBMDXPS6/action/author_attestation","sign_citation":"https://pith.science/pith/42UH2MPZXMB3WLFUQQYBMDXPS6/action/citation_signature","submit_replication":"https://pith.science/pith/42UH2MPZXMB3WLFUQQYBMDXPS6/action/replication_record"}},"created_at":"2026-05-18T02:20:38.979369+00:00","updated_at":"2026-05-18T02:20:38.979369+00:00"}