A computer-aided approach for approximate Nash equilibria
From MaRDI portal
Cites work
- A polynomial-time algorithm for 1/3-approximate Nash equilibria in bimatrix games
- An axiomatic basis for computer programming
- Approximate Nash Equilibria for Multi-player Games
- Beating \(1-\frac{1}{e}\) for ordered prophets
- Computing approximate Nash equilibria in polymatrix games
- Edge-weighted online bipartite matching
- Empirical distribution of equilibrium play and its testing application
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Improved approximation ratios of fixed-price mechanisms in bilateral trades
- Logic and structure
- New algorithms for approximate Nash equilibria in bimatrix games
- New bounds for matrix multiplication: from alpha to omega
- Non-cooperative games
- On the Complexity of Nash Equilibria and Other Fixed Points
- On the optimal fixed-price mechanism in bilateral trade
- Online stochastic matching: new algorithms with better bounds
- Order selection prophet inequality: from threshold optimization to arrival time design
- Prophet secretary through blind strategies
- Settling the complexity of computing approximate two-player Nash equilibria
- Settling the complexity of computing two-player Nash equilibria
- The complexity of computing a Nash equilibrium
This page was built for publication: A computer-aided approach for approximate Nash equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285579)
