{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:B53NTV3WD4ZFSH6DVKCFLAVJAU","short_pith_number":"pith:B53NTV3W","schema_version":"1.0","canonical_sha256":"0f76d9d7761f32591fc3aa845582a9051210fa278bac9eaa0a101f9304bc4791","source":{"kind":"arxiv","id":"1211.1699","version":3},"attestation_state":"computed","paper":{"title":"Optimal Auctions via the Multiplicative Weight Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Anand Bhalgat, Kamesh Munagala, Sreenivas Gollapudi","submitted_at":"2012-11-07T21:45:50Z","abstract_excerpt":"We show that the multiplicative weight update method provides a simple recipe for designing and analyzing optimal Bayesian Incentive Compatible (BIC) auctions, and reduces the time complexity of the problem to pseudo-polynomial in parameters that depend on single agent instead of depending on the size of the joint type space. We use this framework to design computationally efficient optimal auctions that satisfy ex-post Individual Rationality in the presence of constraints such as (hard, private) budgets and envy-freeness. We also design optimal auctions when buyers and a seller's utility func"},"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":"1211.1699","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-11-07T21:45:50Z","cross_cats_sorted":[],"title_canon_sha256":"0c8e2297745d235d8783b2267e9aa46086edcf551685b9a63848222bca2f9d24","abstract_canon_sha256":"168d42651255f7d1d07a5ae2746bdc430f5e783dda870b2dcfa5fe7285285083"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:19.455107Z","signature_b64":"JUI3q44/t8qbPTc6GhGpTzfUMKAX1PhSi0861xWZUNp1tbzp8p5ZJIv6NeQ4rWLmIce5pdAfcm9JDaOZPuWVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f76d9d7761f32591fc3aa845582a9051210fa278bac9eaa0a101f9304bc4791","last_reissued_at":"2026-05-18T03:28:19.454499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:19.454499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Auctions via the Multiplicative Weight Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Anand Bhalgat, Kamesh Munagala, Sreenivas Gollapudi","submitted_at":"2012-11-07T21:45:50Z","abstract_excerpt":"We show that the multiplicative weight update method provides a simple recipe for designing and analyzing optimal Bayesian Incentive Compatible (BIC) auctions, and reduces the time complexity of the problem to pseudo-polynomial in parameters that depend on single agent instead of depending on the size of the joint type space. We use this framework to design computationally efficient optimal auctions that satisfy ex-post Individual Rationality in the presence of constraints such as (hard, private) budgets and envy-freeness. We also design optimal auctions when buyers and a seller's utility func"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1699","kind":"arxiv","version":3},"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":"1211.1699","created_at":"2026-05-18T03:28:19.454598+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1699v3","created_at":"2026-05-18T03:28:19.454598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1699","created_at":"2026-05-18T03:28:19.454598+00:00"},{"alias_kind":"pith_short_12","alias_value":"B53NTV3WD4ZF","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"B53NTV3WD4ZFSH6D","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"B53NTV3W","created_at":"2026-05-18T12:26:58.693483+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/B53NTV3WD4ZFSH6DVKCFLAVJAU","json":"https://pith.science/pith/B53NTV3WD4ZFSH6DVKCFLAVJAU.json","graph_json":"https://pith.science/api/pith-number/B53NTV3WD4ZFSH6DVKCFLAVJAU/graph.json","events_json":"https://pith.science/api/pith-number/B53NTV3WD4ZFSH6DVKCFLAVJAU/events.json","paper":"https://pith.science/paper/B53NTV3W"},"agent_actions":{"view_html":"https://pith.science/pith/B53NTV3WD4ZFSH6DVKCFLAVJAU","download_json":"https://pith.science/pith/B53NTV3WD4ZFSH6DVKCFLAVJAU.json","view_paper":"https://pith.science/paper/B53NTV3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1699&json=true","fetch_graph":"https://pith.science/api/pith-number/B53NTV3WD4ZFSH6DVKCFLAVJAU/graph.json","fetch_events":"https://pith.science/api/pith-number/B53NTV3WD4ZFSH6DVKCFLAVJAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B53NTV3WD4ZFSH6DVKCFLAVJAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B53NTV3WD4ZFSH6DVKCFLAVJAU/action/storage_attestation","attest_author":"https://pith.science/pith/B53NTV3WD4ZFSH6DVKCFLAVJAU/action/author_attestation","sign_citation":"https://pith.science/pith/B53NTV3WD4ZFSH6DVKCFLAVJAU/action/citation_signature","submit_replication":"https://pith.science/pith/B53NTV3WD4ZFSH6DVKCFLAVJAU/action/replication_record"}},"created_at":"2026-05-18T03:28:19.454598+00:00","updated_at":"2026-05-18T03:28:19.454598+00:00"}