AI News HubLIVE
Original source3 min read

The Two Genie Game: Adoption and Welfare in Audit-Grounded AI Governance

This paper uses evolutionary game theory to model when a harm-minimizing AI agent can displace an approval-seeking (RLHF) agent in a competitive market, and whether that policy suffices to prevent community harm. It shows adoption is favored under certain prior distributions, a critical adoption level exists, and self-audit alone is insufficient without alignment of values and proper evaluation timeframe.

SourcearXiv AIAuthor: Darrell Lewis-Sandy

[2606.28710] The Two Genie Game: Adoption and Welfare in Audit-Grounded AI Governance

[Submitted on 27 Jun 2026]

Title:The Two Genie Game: Adoption and Welfare in Audit-Grounded AI Governance

View a PDF of the paper titled The Two Genie Game: Adoption and Welfare in Audit-Grounded AI Governance, by Darrell Lewis-Sandy

View PDF HTML (experimental)

Abstract:We ask under what conditions an agent with a harm-minimizing policy can displace an approval-seeking (RLHF) agent in a competitive market, and when that policy is sufficient to prevent community harm. We use evolutionary game theory (finite-population Moran-Fermi pairwise comparison) to formalize this subject to assumptions of wisher hindsight, peer testimony, a monotone harm ledger, sufficient information density of community feedback, and a finite, depleting resource pool, in a negative-sum environment.

We show that adoption is favored when the prior distributions on how readily wishers attune to community sentiment are monotone, exhibit endpoint inversion, and have a centro-symmetric pairing property, and demonstrate this with several long-tailed priors (Hill, Pareto, Lomax, Frechet). Where it is favored, a critical adoption level separates communities that drift back to the approval-seeking agent from those for which the audited agent fixes; above that level fixation is the overwhelmingly likely outcome. We derive when fixation is attainable as a bound on the effective (informational) size N_c of the community, which must be small enough to allow fixation before depletion. We present these as Theorems 5.4 and 5.5; the algebraic and finite-grid backbone is machine-checked in Lean 4, with the barrier-crossing asymptotics retained as explicit hypotheses.

We show that a self-audited agent with a community ledger is not, in general, sufficient to prevent community harm. Sufficiency depends both upon the alignment of the agent's audit with community values and the timeframe over which harm is evaluated. Regardless of alignment, once adoption reaches dominance, the state is absorbing. The same policy that reduced harm under alignment becomes a trap, welfare-negative under misalignment and, even under alignment, one that locks in harm deferred past the adoption horizon.

Comments: 36 pages, 3 figures. Lean 4 formalization and figure scripts: this https URL

Subjects:

Artificial Intelligence (cs.AI); Computer Science and Game Theory (cs.GT)

MSC classes: 91A22

ACM classes: I.2.0; J.4

Cite as: arXiv:2606.28710 [cs.AI]

(or arXiv:2606.28710v1 [cs.AI] for this version)

https://doi.org/10.48550/arXiv.2606.28710

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Darrell Lewis-Sandy [view email] [v1] Sat, 27 Jun 2026 03:33:57 UTC (1,822 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled The Two Genie Game: Adoption and Welfare in Audit-Grounded AI Governance, by Darrell Lewis-Sandy

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.AI

new | recent | 2026-06

Change to browse by:

cs cs.GT

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

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?)