1 citations · 1 across the 3 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2026
An empirical study of Fictitious Play for estimating Nash equilibria in first-price auctions with correlated values
Benjamin Heymann, Panayotis Mertikopoulos
This study concerns the computation of the Nash equilibria of first-price auctions with correlated values. Although some equilibrium computation methods exist for auctions with ind…
cs.GT2024
Learning in Games with Progressive Hiding
Benjamin Heymann, Marc Lanctot
When learning to play an imperfect information game, it is often easier to first start with the basic mechanics of the game rules. For example, one can play several example rounds…
cs.GT2023★ 1 cited
Some bidding games converging to their unique pure equilibrium
Benjamin Heymann, Alejandro Jofré
We introduce a class of Bayesian bidding games for which we prove that the set of pure Nash equilibria is a (non-empty) sublattice and we give a sufficient condition for uniqueness…