Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > physics > arXiv:2509.09181

Help | Advanced Search

Physics > Physics and Society

arXiv:2509.09181 (physics)
[Submitted on 11 Sep 2025 ]

Title: Incomplete Reputation Information and Punishment in Indirect Reciprocity

Title: 不完全的声誉信息与间接互惠中的惩罚

Authors:Heejeong Kim, Yohsuke Murase
Abstract: Indirect reciprocity promotes cooperation by allowing individuals to help others based on reputation rather than direct reciprocation. Because it relies on accurate reputation information, its effectiveness can be undermined by information gaps. We examine two forms of incomplete information: incomplete observation, in which donor actions are observed only probabilistically, and reputation fading, in which recipient reputations are sometimes classified as "Unknown". Using analytical frameworks for public assessment, we show that these seemingly similar models yield qualitatively different outcomes. Under incomplete observation, the conditions for cooperation are unchanged, because less frequent updates are exactly offset by higher reputational stakes. In contrast, reputation fading hinders cooperation, requiring higher benefit-to-cost ratios as the identification probability decreases. We then evaluate costly punishment as a third action alongside cooperation and defection. Norms incorporating punishment can sustain cooperation across broader parameter ranges without reducing efficiency in the reputation fading model. This contrasts with previous work, which found punishment ineffective under a different type of information limitation, and highlights the importance of distinguishing between types of information constraints. Finally, we review past studies to identify when punishment is effective and when it is not in indirect reciprocity.
Abstract: 间接互惠通过允许个体根据声誉而非直接互惠来帮助他人来促进合作。 由于它依赖于准确的声誉信息,其有效性可能因信息缺口而受到损害。 我们研究了两种不完整信息的形式:不完全观察,其中捐赠者的行为仅以概率方式被观察到,以及声誉消退,其中接收者的声誉有时被归类为“未知”。 使用公共评估的分析框架,我们表明这些看似相似的模型产生了定性不同的结果。 在不完全观察下,合作的条件保持不变,因为更新频率较低恰好被更高的声誉风险所抵消。 相反,声誉消退阻碍了合作,随着识别概率的降低,需要更高的收益与成本比率。 然后,我们将代价高昂的惩罚作为第三种行动,与合作和背叛并列。 包含惩罚的规范可以在不减少声誉消退模型中效率的情况下,在更广泛的参数范围内维持合作。 这与之前的研究结果形成对比,之前的研究发现惩罚在另一种类型的信息限制下无效,并突显了区分信息约束类型的重要性。 最后,我们回顾了以往的研究,以确定在间接互惠中惩罚何时有效以及何时无效。
Subjects: Physics and Society (physics.soc-ph) ; Populations and Evolution (q-bio.PE)
Cite as: arXiv:2509.09181 [physics.soc-ph]
  (or arXiv:2509.09181v1 [physics.soc-ph] for this version)
  https://doi.org/10.48550/arXiv.2509.09181
arXiv-issued DOI via DataCite
Journal reference: RIKEN-iTHEMS-Report-25

Submission history

From: Yohsuke Murase [view email]
[v1] Thu, 11 Sep 2025 06:34:32 UTC (255 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
q-bio.PE
< prev   |   next >
new | recent | 2025-09
Change to browse by:
physics
physics.soc-ph
q-bio

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号