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 Belief Functions in the Coq Proof Assistant
Install
Dune Dependency
Authors
Maintainers
Sources
1.0.0.tar.gz
sha512=5dc6cc1f8812213c7519ff192f0eaf76b9920f7b10835668a2bc35d15917bb9db52668f0fda80c19ce58dc8cfa0dfe1701d1079457a47f077661d1edce5889d6
Description
We extend Bayesian games to the theory of belief functions. 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 category:Computer Science/Decision Procedures and Certified Algorithms/Correctness proofs of algorithms logpath:BelGames date:2022-09-22Published: 22 Sep 2022
Dependencies (2)
-
coq-mathcomp-algebra
(>= "1.13" & < "1.16~")
-
coq
(>= "8.14" & < "8.17~")
Dev Dependencies
None
Used by
None
Conflicts
None
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page