License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TYPES.2016.14
URN: urn:nbn:de:0030-drops-98486
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9848/
Martin-Dorel, Érik ;
Soloviev, Sergei
A Formal Study of Boolean Games with Random Formulas as Payoff Functions
Abstract
In this paper, we present a probabilistic analysis of Boolean games. We consider the class of Boolean games where payoff functions are given by random Boolean formulas. This permits to study certain properties of this class in its totality, such as the probability of existence of a winning strategy, including its asymptotic behaviour. With the help of the Coq proof assistant, we develop a Coq library of Boolean games, to provide a formal proof of our results, and a basis for further developments.
BibTeX - Entry
@InProceedings{martindorel_et_al:LIPIcs:2018:9848,
author = {{\'E}rik Martin-Dorel and Sergei Soloviev},
title = {{A Formal Study of Boolean Games with Random Formulas as Payoff Functions}},
booktitle = {22nd International Conference on Types for Proofs and Programs (TYPES 2016)},
pages = {14:1--14:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-065-1},
ISSN = {1868-8969},
year = {2018},
volume = {97},
editor = {Silvia Ghilezan and Herman Geuvers and Jelena Ivetić},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9848},
URN = {urn:nbn:de:0030-drops-98486},
doi = {10.4230/LIPIcs.TYPES.2016.14},
annote = {Keywords: Boolean games, Random process, Coq formal proofs}
}
|
Keywords: |
|
Boolean games, Random process, Coq formal proofs |
|
Collection: |
|
22nd International Conference on Types for Proofs and Programs (TYPES 2016) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
05.11.2018 |
