Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · cs/0701139

Time and the Prisoner's Dilemma

Yishay Mor·Jeffrey S. Rosenschein
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper examines the integration of computational complexity into game theoretic models. The example focused on is the Prisoner's Dilemma, repeated for a finite length of time. We show that a minimal bound on the players' computational ability is sufficient to enable cooperative behavior. In addition, a variant of the repeated Prisoner's Dilemma game is suggested, in which players have the choice of opting out. This modification enriches the game and suggests dominance of cooperative strategies. Competitive analysis is suggested as a tool for investigating sub-optimal (but computationally tractable) strategies and game theoretic models in general. Using competitive analysis, it is shown that for bounded players, a sub-optimal strategy might be the optimal choice, given resource limitations.

Explore related subjects

cs.GTcs.AI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yishay Mor, Jeffrey S. Rosenschein. 2007-01-22. Time and the Prisoner's Dilemma. https://arxiv.org/abs/cs/0701139

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Project Submission Games in Participatory Budgeting

We introduce the framework of project submission games, capturing the behavior of project proposers in participatory budgeting (and multiwinner elections). Here, each proposer submits a subset of project proposals, aiming at maximizing the total cost of those that get funded. We focus on finding conditions under which pure Nash equilibria (NE) exist in our games, and on the complexity of checking whether they exist. We also seek algorithms for computing best responses for the proposers

cs.GT↗
arXiv2026

Domination-Avoiding Learning Agents Cannot Collude

An influential paper of Calvano et al. empirically demonstrated that Q-learning agents spontaneously collude when placed as sellers that compete on prices in a natural market model. More recent results of Fish et al. empirically demonstrated that similar collusion happens with commercial LLMs. We formally prove that such collusion can also happen with external-regret-minimizing agents. We identify a very general class of agents, which we term Domination-Avoiding agents, that provably do not collude in such markets. This class contains all Mean-Based agents and all internal-regret-minimizing agents, as well as others such as Multiplicative-Weight agents with variable learning rate and contextual variants thereof. More generally we show that, in any game, this class of agents is guaranteed to jointly learn to almost never play strategies that are eliminated by repeated elimination of purely dominated strategies.

cs.GT↗
arXiv2026

Settling the Complexity of Hylland--Zeckhauser Equilibria

The Hylland--Zeckhauser (HZ) mechanism is a foundational framework for allocating indivisible goods in one-sided matching markets via lotteries supported by competitive prices and equal artificial budgets. We resolve the exact computational complexity of the HZ scheme by proving that computing an exact HZ equilibrium is FIXP-complete, thereby settling a conjecture of Vazirani and Yannakakis. Notably, this hardness persists even when computing the equilibrium allocation alone. We establish our hardness result via a reduction that encodes quadratic fixed-point equations into a reciprocal variational inequality. On the algorithmic side, we present a deterministic polynomial-time approximation algorithm that achieves an additive error of $0.0755211 + δ$ for any $δ> 0$, significantly improving upon the previous $1/e$ guarantee.

cs.GT↗