Gambit
Gambit: Software Tools for Game Theory Gambit is a library of game theory software and tools for the construction and analysis of finite extensive and strategic games. Gambit is designed to be portable across platforms, and runs on Linux, Mac OS X, and Windows
Keywords for this software
References in zbMATH (referenced in 53 articles )
Showing results 1 to 20 of 53.
Sorted by year (- Etessami, Kousha: The complexity of computing a (quasi-)perfect equilibrium for an (n)-player extensive form game (2021)
- Fehrler, Sebastian; Schneider, Maik T.: Buying supermajorities in the lab (2021)
- Han, Dongge; Harrenstein, Paul; Nugent, Steven; Philpott, Jonathan; Wooldridge, Michael: Behavioural strategies in weighted Boolean games (2021)
- Bosshard, Vitor; Bünz, Benedikt; Lubin, Benjamin; Seuken, Sven: Computing Bayes-Nash equilibria in combinatorial auctions with verification (2020)
- Finzi, Alberto; Lukasiewicz, Thomas: Partially observable game-theoretic agent programming in Golog (2020)
- García-Pola, Bernardo; Iriberri, Nagore; Kovářík, Jaromír: Non-equilibrium play in centipede games (2020)
- Gupta, Anshul; Schewe, Sven: Buying optimal payoffs in bi-matrix games (2018)
- Honda, Jun: Games with the total bandwagon property meet the Quint-Shubik conjecture (2018)
- Vincent Knight; James Campbell: Nashpy: A Python library for the computation of Nash equilibria (2018) not zbMATH
- Figueroa, Nicolas; L’Huillier, Gastón; Weber, Richard: Adversarial classification using signaling games with an application to phishing detection (2017)
- Greenwald, Amy; Li, Jiacui; Sodomka, Eric: Solving for best responses and equilibria in extensive-form games with reinforcement learning methods (2017)
- The GAMBIT Dark Matter Workgroup: Torsten Bringmann, Jan Conrad, Jonathan M. Cornell, Lars A. Dal, Joakim Edsjo, Ben Farmer, Felix Kahlhoefer, Anders Kvellestad, Antje Putze, Christopher Savage, Pat Scott, Christoph Weniger, Martin White, Sebastian Wild: DarkBit: A GAMBIT module for computing dark matter observables and likelihoods (2017) arXiv
- Thompson, David R. M.; Leyton-Brown, Kevin: Computational analysis of perfect-information position auctions (2017)
- Wright, James R.; Leyton-Brown, Kevin: Predicting human behavior in unrepeated, simultaneous-move games (2017)
- Knight, V., Campbell, O., Harper, M., Langner, K., Campbell, J., Campbell, T., Carney, A., Chorley, M., Davidson-Pilon, C., Glass, K., Glynatsi, N., Ehrlich, T., Jones, M., Koutsovoulos, G., Tibble, H., Müller, J., Palmer, G., Petunov, P., Slavin, P., Standen, T., Visintini, L. and Molden, K.: An Open Framework for the Reproducible Study of the Iterated Prisoner’s Dilemma (2016) not zbMATH
- Montero, Maria; Possajennikov, Alex; Sefton, Martin; Turocy, Theodore L.: Majoritarian Blotto contests with asymmetric battlefields: an experiment on apex games (2016)
- Zhang, Boyu: Quantal response methods for equilibrium selection in normal form games (2016)
- Góngora, Pedro A.; Rosenblueth, David A.: A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria (2015)
- Kovach, Nicholas S.; Gibson, Alan S.; Lamont, Gary B.: Hypergame theory: a model for conflict, misperception, and deception (2015)
- Martínez, Manolo: Deception in sender-receiver games (2015)
Further publications can be found at: http://www.gambit-project.org/doc/biblio.html