coq-belgames.opam

# This file was generated from `meta.yml`, please do not edit manually.
# Follow the instructions on https://github.com/coq-community/templates to regenerate.

opam-version: "2.0"
maintainer: "erik.martin-dorel@irit.fr"
version: "dev"

homepage: "https://github.com/pPomCo/belgames"
dev-repo: "git+https://github.com/pPomCo/belgames.git"
bug-reports: "https://github.com/pPomCo/belgames/issues"
license: "MIT"

synopsis: "BelGames: A Formal Theory of Games of Incomplete Information Based on Belief Functions in the Coq Proof Assistant"
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."""

build: [make "-j%{jobs}%"]
install: [make "install"]
depends: [
  "coq" {(>= "8.16" & < "8.19~")}
  "coq-mathcomp-algebra" {>= "2.0"}
]

tags: [
  "keyword:games of incomplete information"
  "keyword:belief functions theory"
  "keyword:mathcomp/ssreflect"
  "logpath:BelGames"
]
authors: [
  "Pierre Pomeret-Coquot"
  "Erik Martin-Dorel"
  "Hélène Fargier"
]