{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4H2LF6D2TEGXSUCD4INHJ2HPQ5","short_pith_number":"pith:4H2LF6D2","schema_version":"1.0","canonical_sha256":"e1f4b2f87a990d795043e21a74e8ef87733112ec1834134af7c35b21828c6b81","source":{"kind":"arxiv","id":"1108.2728","version":3},"attestation_state":"computed","paper":{"title":"Market Mechanisms with Non-Price-Taking Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Ali Kakhbod","submitted_at":"2011-08-12T22:03:45Z","abstract_excerpt":"The paper develops a decentralized resource allocation mechanism for allocating divisible goods with capacity constraints to non-price-taking agents with general concave utilities. The proposed mechanism is always budget balanced, individually rational, and it converges to an optimal solution of the corresponding centralized problem. Such a mechanism is very useful in a network with general topology and no auctioneer where the competitive agents/users want different type of services."},"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":"1108.2728","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-12T22:03:45Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"4785a407c5811e9211e469c197c2c01acd3138b8fe69706c953f7240247fd363","abstract_canon_sha256":"83ffa8e1be72309020e8fa3a66a7d2fcd2f0823771aba2fea8f55510f6db6673"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:39.494694Z","signature_b64":"tUyQCh4So+eEc3EUPLX5JYBmtjICkKqt7jB52cYnnz8aNMCEpgDUPh9RjIh7KTgN4Qr6dlEbDOvLShnmj04SAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1f4b2f87a990d795043e21a74e8ef87733112ec1834134af7c35b21828c6b81","last_reissued_at":"2026-05-18T04:02:39.494001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:39.494001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Market Mechanisms with Non-Price-Taking Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Ali Kakhbod","submitted_at":"2011-08-12T22:03:45Z","abstract_excerpt":"The paper develops a decentralized resource allocation mechanism for allocating divisible goods with capacity constraints to non-price-taking agents with general concave utilities. The proposed mechanism is always budget balanced, individually rational, and it converges to an optimal solution of the corresponding centralized problem. Such a mechanism is very useful in a network with general topology and no auctioneer where the competitive agents/users want different type of services."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2728","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":"1108.2728","created_at":"2026-05-18T04:02:39.494120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2728v3","created_at":"2026-05-18T04:02:39.494120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2728","created_at":"2026-05-18T04:02:39.494120+00:00"},{"alias_kind":"pith_short_12","alias_value":"4H2LF6D2TEGX","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4H2LF6D2TEGXSUCD","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4H2LF6D2","created_at":"2026-05-18T12:26:20.644004+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/4H2LF6D2TEGXSUCD4INHJ2HPQ5","json":"https://pith.science/pith/4H2LF6D2TEGXSUCD4INHJ2HPQ5.json","graph_json":"https://pith.science/api/pith-number/4H2LF6D2TEGXSUCD4INHJ2HPQ5/graph.json","events_json":"https://pith.science/api/pith-number/4H2LF6D2TEGXSUCD4INHJ2HPQ5/events.json","paper":"https://pith.science/paper/4H2LF6D2"},"agent_actions":{"view_html":"https://pith.science/pith/4H2LF6D2TEGXSUCD4INHJ2HPQ5","download_json":"https://pith.science/pith/4H2LF6D2TEGXSUCD4INHJ2HPQ5.json","view_paper":"https://pith.science/paper/4H2LF6D2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2728&json=true","fetch_graph":"https://pith.science/api/pith-number/4H2LF6D2TEGXSUCD4INHJ2HPQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/4H2LF6D2TEGXSUCD4INHJ2HPQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4H2LF6D2TEGXSUCD4INHJ2HPQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4H2LF6D2TEGXSUCD4INHJ2HPQ5/action/storage_attestation","attest_author":"https://pith.science/pith/4H2LF6D2TEGXSUCD4INHJ2HPQ5/action/author_attestation","sign_citation":"https://pith.science/pith/4H2LF6D2TEGXSUCD4INHJ2HPQ5/action/citation_signature","submit_replication":"https://pith.science/pith/4H2LF6D2TEGXSUCD4INHJ2HPQ5/action/replication_record"}},"created_at":"2026-05-18T04:02:39.494120+00:00","updated_at":"2026-05-18T04:02:39.494120+00:00"}