{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:H3CWUYGOKXP47SBYYEZXCFS2AI","short_pith_number":"pith:H3CWUYGO","schema_version":"1.0","canonical_sha256":"3ec56a60ce55dfcfc838c13371165a02324ae2a9ad992c0c6040e9aec47cbd46","source":{"kind":"arxiv","id":"1401.3852","version":1},"attestation_state":"computed","paper":{"title":"Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Enrico Malizia, Francesco Scarcello, Gianluigi Greco, Luigi Palopoli","submitted_at":"2014-01-16T04:59:32Z","abstract_excerpt":"Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than by acting in isolation. In the classical Transferable Utility (TU) setting, coalition worths can be freely distributed amongst agents. However, in several application scenarios, this is not the case and the Non-Transferable Utility setting (NTU) must be considered, where additional application-oriented constraints are imposed on the possible worth distributions. In this paper, an approach to define NTU games is propos"},"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":"1401.3852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-16T04:59:32Z","cross_cats_sorted":[],"title_canon_sha256":"bf7ddcaf4550c8296f22b6a4676a655f1ac5e3df2d706b61f75453550d541405","abstract_canon_sha256":"7ab0b3eb5deb3283e95bcb89171622771ab6dc9a12b89ea449d0c5fc9da813c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.591635Z","signature_b64":"+Tq/2FwIOERTF8GqcZrTRB/zThzKRzi5NlAHto8sQhP41ZbxBjQWNAxIU82jJsfHlNpT9IqUeyw7Cp2J67IKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ec56a60ce55dfcfc838c13371165a02324ae2a9ad992c0c6040e9aec47cbd46","last_reissued_at":"2026-05-18T03:02:06.590791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.590791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Enrico Malizia, Francesco Scarcello, Gianluigi Greco, Luigi Palopoli","submitted_at":"2014-01-16T04:59:32Z","abstract_excerpt":"Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than by acting in isolation. In the classical Transferable Utility (TU) setting, coalition worths can be freely distributed amongst agents. However, in several application scenarios, this is not the case and the Non-Transferable Utility setting (NTU) must be considered, where additional application-oriented constraints are imposed on the possible worth distributions. In this paper, an approach to define NTU games is propos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3852","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":"1401.3852","created_at":"2026-05-18T03:02:06.590929+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3852v1","created_at":"2026-05-18T03:02:06.590929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3852","created_at":"2026-05-18T03:02:06.590929+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3CWUYGOKXP4","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3CWUYGOKXP47SBY","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3CWUYGO","created_at":"2026-05-18T12:28:30.664211+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/H3CWUYGOKXP47SBYYEZXCFS2AI","json":"https://pith.science/pith/H3CWUYGOKXP47SBYYEZXCFS2AI.json","graph_json":"https://pith.science/api/pith-number/H3CWUYGOKXP47SBYYEZXCFS2AI/graph.json","events_json":"https://pith.science/api/pith-number/H3CWUYGOKXP47SBYYEZXCFS2AI/events.json","paper":"https://pith.science/paper/H3CWUYGO"},"agent_actions":{"view_html":"https://pith.science/pith/H3CWUYGOKXP47SBYYEZXCFS2AI","download_json":"https://pith.science/pith/H3CWUYGOKXP47SBYYEZXCFS2AI.json","view_paper":"https://pith.science/paper/H3CWUYGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3852&json=true","fetch_graph":"https://pith.science/api/pith-number/H3CWUYGOKXP47SBYYEZXCFS2AI/graph.json","fetch_events":"https://pith.science/api/pith-number/H3CWUYGOKXP47SBYYEZXCFS2AI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3CWUYGOKXP47SBYYEZXCFS2AI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3CWUYGOKXP47SBYYEZXCFS2AI/action/storage_attestation","attest_author":"https://pith.science/pith/H3CWUYGOKXP47SBYYEZXCFS2AI/action/author_attestation","sign_citation":"https://pith.science/pith/H3CWUYGOKXP47SBYYEZXCFS2AI/action/citation_signature","submit_replication":"https://pith.science/pith/H3CWUYGOKXP47SBYYEZXCFS2AI/action/replication_record"}},"created_at":"2026-05-18T03:02:06.590929+00:00","updated_at":"2026-05-18T03:02:06.590929+00:00"}