{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:O5CVFZRLXI4TPFZDZW4ZK7BEW2","short_pith_number":"pith:O5CVFZRL","schema_version":"1.0","canonical_sha256":"774552e62bba39379723cdb9957c24b6b4722221d194c150f7315513960de5c3","source":{"kind":"arxiv","id":"1711.06871","version":2},"attestation_state":"computed","paper":{"title":"Anonymous Hedonic Game for Task Allocation in a Large-Scale Multiple Agent System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.MA","authors_text":"Antonios Tsourdos, Hyo-Sang Shin, Inmo Jang","submitted_at":"2017-11-18T14:56:36Z","abstract_excerpt":"This paper proposes a novel game-theoretical autonomous decision-making framework to address a task allocation problem for a swarm of multiple agents. We consider cooperation of self-interested agents, and show that our proposed decentralized algorithm guarantees convergence of agents with social inhibition to a Nash stable partition (i.e., social agreement) within polynomial time. The algorithm is simple and executable based on local interactions with neighbor agents under a strongly-connected communication network and even in asynchronous environments. We analytically present a mathematical "},"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":"1711.06871","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-18T14:56:36Z","cross_cats_sorted":["cs.AI","cs.GT"],"title_canon_sha256":"cef16093de6e3caf6d135dad507572689050f7555a2577a930c9b72e480a8e79","abstract_canon_sha256":"46c3af47453f286079bc3cda51c0b0829592fd332c534c8d10ee97edd2a8e18e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:39.427021Z","signature_b64":"czL4aGFsqeXW/4KlAcq/YXQ5eHIjHXjFT33aM56OS96waVcn00ld5iIpPyJiFLSOyyRapyEpMvBw/wgwCThaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"774552e62bba39379723cdb9957c24b6b4722221d194c150f7315513960de5c3","last_reissued_at":"2026-05-17T23:59:39.426371Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:39.426371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anonymous Hedonic Game for Task Allocation in a Large-Scale Multiple Agent System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.MA","authors_text":"Antonios Tsourdos, Hyo-Sang Shin, Inmo Jang","submitted_at":"2017-11-18T14:56:36Z","abstract_excerpt":"This paper proposes a novel game-theoretical autonomous decision-making framework to address a task allocation problem for a swarm of multiple agents. We consider cooperation of self-interested agents, and show that our proposed decentralized algorithm guarantees convergence of agents with social inhibition to a Nash stable partition (i.e., social agreement) within polynomial time. The algorithm is simple and executable based on local interactions with neighbor agents under a strongly-connected communication network and even in asynchronous environments. We analytically present a mathematical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06871","kind":"arxiv","version":2},"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":"1711.06871","created_at":"2026-05-17T23:59:39.426491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06871v2","created_at":"2026-05-17T23:59:39.426491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06871","created_at":"2026-05-17T23:59:39.426491+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5CVFZRLXI4T","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5CVFZRLXI4TPFZD","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5CVFZRL","created_at":"2026-05-18T12:31:34.259226+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/O5CVFZRLXI4TPFZDZW4ZK7BEW2","json":"https://pith.science/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2.json","graph_json":"https://pith.science/api/pith-number/O5CVFZRLXI4TPFZDZW4ZK7BEW2/graph.json","events_json":"https://pith.science/api/pith-number/O5CVFZRLXI4TPFZDZW4ZK7BEW2/events.json","paper":"https://pith.science/paper/O5CVFZRL"},"agent_actions":{"view_html":"https://pith.science/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2","download_json":"https://pith.science/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2.json","view_paper":"https://pith.science/paper/O5CVFZRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06871&json=true","fetch_graph":"https://pith.science/api/pith-number/O5CVFZRLXI4TPFZDZW4ZK7BEW2/graph.json","fetch_events":"https://pith.science/api/pith-number/O5CVFZRLXI4TPFZDZW4ZK7BEW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2/action/storage_attestation","attest_author":"https://pith.science/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2/action/author_attestation","sign_citation":"https://pith.science/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2/action/citation_signature","submit_replication":"https://pith.science/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2/action/replication_record"}},"created_at":"2026-05-17T23:59:39.426491+00:00","updated_at":"2026-05-17T23:59:39.426491+00:00"}