Arbeitspapier

Additive plausibility characterizes the supports of consistent assessments

We introduce three definitions. First, we let a basement be a set of nodes and actions that supports at least one assessment. Second, we derive from an arbitrary basement its implied plausibility (i.e. infinite-relative-likelihood) relation among the game's nodes. Third, we say that this plausibility relation is additive if it has a completion represented by the nodal sums of a mass function defined over the game's actions. This last construction is built upon Streufert (2012)'s result that nodes can be specified as sets of actions. Our central result is that a basement has additive plausibility if and only if it supports at least one consistent assessment. The result's proof parallels the early foundations of probability theory and requires only Farkas' Lemma. The result leads to related characterizations, to an easily tested necessary condition for consistency, and to the repair of a nontrivial gap in a proof of Kreps and Wilson (1982).

Sprache
Englisch

Erschienen in
Series: Research Report ; No. 2012-3

Klassifikation
Wirtschaft
Noncooperative Games
Thema
plausibility relation
additive representation
plausibility mass function
infinite relative likelihood

Ereignis
Geistige Schöpfung
(wer)
Streufert, Peter A.
Ereignis
Veröffentlichung
(wer)
The University of Western Ontario, Department of Economics
(wo)
London (Ontario)
(wann)
2012

Handle
Letzte Aktualisierung
10.03.2025, 11:41 MEZ

Datenpartner

Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.

Objekttyp

  • Arbeitspapier

Beteiligte

  • Streufert, Peter A.
  • The University of Western Ontario, Department of Economics

Entstanden

  • 2012

Ähnliche Objekte (12)