{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DBNWUYOSOHXNETFCKYHJQ3RISK","short_pith_number":"pith:DBNWUYOS","schema_version":"1.0","canonical_sha256":"185b6a61d271eed24ca2560e986e2892a9df992d5cae5f98ed740f2c3b41e1af","source":{"kind":"arxiv","id":"1102.1341","version":1},"attestation_state":"computed","paper":{"title":"Ensuring the boundedness of the core of games with restricted cooperation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.GT","authors_text":"Michel Grabisch","submitted_at":"2011-02-07T15:45:38Z","abstract_excerpt":"The core of a cooperative game on a set of players $N$ is one of the most popular concept of solution. When cooperation is restricted (feasible coalitions form a subcollection $\\cF$ of $2^N$), the core may become unbounded, which makes it usage questionable in practice. Our proposal is to make the core bounded by turning some of the inequalities defining the core into equalities (additional efficiency constraints). We address the following mathematical problem: can we find a minimal set of inequalities in the core such that, if turned into equalities, the core becomes bounded? The new core obt"},"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":"1102.1341","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-07T15:45:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4c203b26544b4e37103ec1312213b6de5a4bc9c9cebc4154b218ccde432b10f2","abstract_canon_sha256":"a4375f3db7f0a5f7f57daadf60afebc129907e2b38ce95dae7814c28a2dde088"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:54.454501Z","signature_b64":"n1g2rjeVw6taqekdrrn1o3AOtEx6kjVLwGMjQSlGsiICcGJtx7DNZKOaeGKgWEMbaVNOHQ2Q4wXI4uFb4LxiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"185b6a61d271eed24ca2560e986e2892a9df992d5cae5f98ed740f2c3b41e1af","last_reissued_at":"2026-05-18T04:29:54.453968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:54.453968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ensuring the boundedness of the core of games with restricted cooperation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.GT","authors_text":"Michel Grabisch","submitted_at":"2011-02-07T15:45:38Z","abstract_excerpt":"The core of a cooperative game on a set of players $N$ is one of the most popular concept of solution. When cooperation is restricted (feasible coalitions form a subcollection $\\cF$ of $2^N$), the core may become unbounded, which makes it usage questionable in practice. Our proposal is to make the core bounded by turning some of the inequalities defining the core into equalities (additional efficiency constraints). We address the following mathematical problem: can we find a minimal set of inequalities in the core such that, if turned into equalities, the core becomes bounded? The new core obt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1341","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":"1102.1341","created_at":"2026-05-18T04:29:54.454052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1341v1","created_at":"2026-05-18T04:29:54.454052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1341","created_at":"2026-05-18T04:29:54.454052+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBNWUYOSOHXN","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBNWUYOSOHXNETFC","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBNWUYOS","created_at":"2026-05-18T12:26:26.731475+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/DBNWUYOSOHXNETFCKYHJQ3RISK","json":"https://pith.science/pith/DBNWUYOSOHXNETFCKYHJQ3RISK.json","graph_json":"https://pith.science/api/pith-number/DBNWUYOSOHXNETFCKYHJQ3RISK/graph.json","events_json":"https://pith.science/api/pith-number/DBNWUYOSOHXNETFCKYHJQ3RISK/events.json","paper":"https://pith.science/paper/DBNWUYOS"},"agent_actions":{"view_html":"https://pith.science/pith/DBNWUYOSOHXNETFCKYHJQ3RISK","download_json":"https://pith.science/pith/DBNWUYOSOHXNETFCKYHJQ3RISK.json","view_paper":"https://pith.science/paper/DBNWUYOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1341&json=true","fetch_graph":"https://pith.science/api/pith-number/DBNWUYOSOHXNETFCKYHJQ3RISK/graph.json","fetch_events":"https://pith.science/api/pith-number/DBNWUYOSOHXNETFCKYHJQ3RISK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBNWUYOSOHXNETFCKYHJQ3RISK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBNWUYOSOHXNETFCKYHJQ3RISK/action/storage_attestation","attest_author":"https://pith.science/pith/DBNWUYOSOHXNETFCKYHJQ3RISK/action/author_attestation","sign_citation":"https://pith.science/pith/DBNWUYOSOHXNETFCKYHJQ3RISK/action/citation_signature","submit_replication":"https://pith.science/pith/DBNWUYOSOHXNETFCKYHJQ3RISK/action/replication_record"}},"created_at":"2026-05-18T04:29:54.454052+00:00","updated_at":"2026-05-18T04:29:54.454052+00:00"}