Researcher profile

Giorgos Stamatopoulos

Giorgos Stamatopoulos contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 17 - UnverifiedVerification L1Unclaimed author
4works
0followers
3topics
1close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

4 published item(s)

preprint2026arXiv

What Suppresses Nash Equilibrium Play in Large Language Models? Mechanistic Evidence and Causal Control

LLM agents are known to deviate from Nash equilibria in strategic interactions, but nobody has looked inside the model to understand why, or asked whether the deviation can be reversed. We do both. Working with four open-source models (Llama-3 and Qwen2.5, 8B to 72B parameters) playing four canonical two-player games, we establish the behavioral picture through self-play and cross-play experiments, then open up the 32-layer Llama-3-8B model and examine what actually happens during a strategic decision. The mechanistic findings are clear. Opponent history is encoded with near-perfect fidelity at the first layer (96% probe accuracy) and consumed progressively, while Nash action encoding is weak throughout, never exceeding 56%. There is no dedicated Nash module. Instead, the model privately favors the Nash action through most of its forward pass, but a prosocial override rooted in pretraining on human text concentrated in the final layers reverses this, reaching 84% probability of cooperation at layer 30. Injecting a learned Nash direction into the residual stream shifts behavior bidirectionally and causally, confirmed through concept clamping. The behavioral experiments surface six scale- and architecture-dependent findings, the most notable being that chain-of-thought reasoning worsens Nash play in small models but achieves near-perfect Nash play above 70B parameters. The cross-play experiments reveal three phenomena invisible in self-play: a small model can unravel any partner's cooperation by defecting early; two large models reinforce each other's cooperative instincts indefinitely; and who moves first determines which Nash equilibrium the system reaches. LLMs do not lack Nash-playing competence. They compute it, then suppress it.

preprint2014arXiv

Cooperative oligopoly games with boundedly rational firms

We analyze cooperative Cournot games with boundedly rational firms. Due to cogni- tive constraints, the members of a coalition cannot accurately predict the coalitional structure of the non-members. Thus, they compute their value using simple heuris- tics. In particular, they assign various non-equilibrium probability distributions over the outsiders' set of partitions. We construct the characteristic function of a coalition in such an environment and we analyze the core of the corresponding games. We show that the core is non-empty provided the number of firms in the market is sufficiently large. Moreover, we show that if two distributions over the set of partitions are related via first-order dominance, then the core of the game under the dominated distribution is a subset of the core under the dominant distribution.

preprint2012arXiv

Strategic delegation in a sequential model with multiple stages

We analyze strategic delegation in a Stackelberg model with an arbitrary number, n, of firms. We show that the n-1 last movers delegate their production decisions to managers whereas the first mover does not. Equilibrium incentive rates are increasing in the order with which managers select quantities. Letting u_i^* denote the equilibrium payoff of the firm whose manager moves in the i-th place, we show that u_n^*>u_{n-1}^*>...>u_2^*>u_1^*. We also compare the delegation outcome of our game with that of a Cournot oligopoly and show that the late (early) moving firms choose higher (lower) incentive rates than the Cournot firms.

preprint2011arXiv

Cooperative oligopoly games: a probabilistic approach

We analyze the core of a cooperative Cournot game. We assume that when contemplating a deviation, the members of a coalition assign positive probability over all possible coalition structures that the non-members can form. We show that when the number of firms in the market is sufficiently large then the core of the underlying cooperative game is non-empty. Moreover, we show that the core of our game is a subset of the γ- core.