Cycles and Optimistic Stability in Graphs: The Role of Competition, Veto Players and Moderators

Gerald Pech

2017

Closed access Metadata (CSL-JSON)
DOI 10.1177/2321022216662094
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

This article provides sufficient conditions for existence of a non-empty optimistic stable standard of behaviour (OSSB) in directed graphs. Graphs which are completely connected by single-player arcs for each player always admit a (non-unique) OSSB. More specifically, a loop is broken by adding a single-player move to some appropriately chosen default position. If there are nodes with a decision cycle over the move to the successor node, introducing veto players ensures that an OSSB exists which assigns a non-empty solution to every vertex along the equilibrium path.