{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/anonymous-hedonic-game-for-task-allocation-in","title":"Anonymous Hedonic Game for Task Allocation in a Large-Scale Multiple Agent System","arxiv_id":"1711.06871","date":"2017-11-18","proceeding":null,"authors":["Inmo Jang","Hyo-Sang Shin","Antonios Tsourdos"],"abstract":"This paper proposes a novel game-theoretical autonomous decision-making\nframework to address a task allocation problem for a swarm of multiple agents.\nWe consider cooperation of self-interested agents, and show that our proposed\ndecentralized algorithm guarantees convergence of agents with social inhibition\nto a Nash stable partition (i.e., social agreement) within polynomial time. The\nalgorithm is simple and executable based on local interactions with neighbor\nagents under a strongly-connected communication network and even in\nasynchronous environments. We analytically present a mathematical formulation\nfor computing the lower bound of suboptimality of the solution, and\nadditionally show that 50% of suboptimality can be at least guaranteed if\nsocial utilities are non-decreasing functions with respect to the number of\nco-working agents. The results of numerical experiments confirm that the\nproposed framework is scalable, fast adaptable against dynamical environments,\nand robust even in a realistic situation.","url_abs":"http://arxiv.org/abs/1711.06871v2","url_pdf":"http://arxiv.org/pdf/1711.06871v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"anonymous-hedonic-game-for-task-allocation-in","repo_url":"https://github.com/inmo-jang/GRAPE","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"decision-making","task_name":"Decision Making"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"inmo-jang/GRAPE","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"cd18b6921896196f1490a4af1db95399b1ddcc5ac27edcec89f9830fbf8b15b9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}