Pith. sign in

REVIEW 1 cited by

Instability and Efficiency of Non-cooperative Games

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.17196 v2 pith:JOZOZ52C submitted 2024-05-27 cs.GT math.OC

Instability and Efficiency of Non-cooperative Games

classification cs.GT math.OC
keywords efficiencygameinformationmediatorimprovewhencaseequilibria
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

It is well known that a non-cooperative game may have multiple equilibria. In this paper we consider the efficiency of games, measured by the ratio between the aggregate payoff over all Nash equilibria and that over all admissible controls. Such efficiency operator is typically unstable with respect to small perturbation of the game. This seemingly bad property can actually be a good news in practice: it is possible that a small change of the game mechanism may improve the efficiency of the game dramatically. We shall introduce a game mediator with limited resources and investigate two mechanism designs aiming to improve the efficiency. Moreover, we compare the mediator's capability of efficiency improvement when she has access to full information or only partial information. When the mechanisms contain only rewards, the mediator has the same power in the two cases. However, when the mediator can use punishments as well, in general she may have a larger power to improve the efficiency in the full information case than in the partial information case.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Stackelberg Games with a Robust Leader

    math.OC 2026-07 conditional novelty 6.0

    A worst-case robust leader's value in continuous-time multi-follower Stackelberg games is formally connected to a Wasserstein-space HJB equation, but the required technical conditions fail for the motivating model.