package coq-belgames
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
BelGames: A Formal Theory of Games of Incomplete Information Based on Non-Monotonic Capacities in the Coq Proof Assistant
Install
Dune Dependency
Authors
Maintainers
Sources
belgames-2.0.0.tar.gz
sha512=7085b2f6e7e5ae8bf8fc4ec0a411e5caef1619f434fb7557ca470606799fcf57bec5d7343c9d776068049632f6f35baf9425586a4cb7d2d81c42476364bf7e5a
Description
We extend Bayesian games to several uncertainty theories (eg. belief functions, imprecise probabilities). We obtain a more expressive class of games we refer to as BelGames. It makes it possible to better capture human behaviors with respect to lack of information. Next, we prove an extended version of the so-called Howson--Rosenthal's theorem, showing that BelGames can be turned into games of complete information, i.e., without any uncertainty.
Tags
keyword:games of incomplete information keyword:belief functions theory keyword:imprecise probability theory category:Computer Science/Decision Procedures and Certified Algorithms/Correctness proofs of algorithms logpath:BelGames date:2023-11-26Published: 06 Nov 2023
Dependencies (2)
-
coq-mathcomp-algebra
(>= "2.0.0" & < "2.1~")
-
coq
(>= "8.16" & < "8.19~")
Dev Dependencies
None
Used by
None
Conflicts
None
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page