SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games · Study

WorkGradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games

Samid Hoda2007

Work2007

Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games

Samid Hoda · Javier Peña · Tüomas Sandholm

53 citations·0/0 files stored·Springer eBooks

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Game Theory and Applications Complexity and Algorithms in Graphs Artificial Intelligence in Games

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 53 citations exist upstream.

References

1999Adaptive Game Playing Using Multiplicative Weights 2003Playing large games using simple strategies 2005Internet and Network Economics 1992The complexity of two-person zero-sum games in extensive form 1996Efficient Computation of Behavior Strategies 1997Representations and solutions for game-theoretic problems 2007Progress in approximate nash equilibria 2007Lossless abstraction of imperfect information games

Cited by

2012Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types 2019Competitive Gradient Descent 2014Near-optimal no-regret algorithms for zero-sum games

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2007Lossless abstraction of imperfect information gamesarticle · 4 shared references 2009New algorithms for approximate Nash equilibria in bimatrix gamesarticle · 4 shared references 2007New Algorithms for Approximate Nash Equilibria in Bimatrix Gamesother · 4 shared references 2008Well Supported Approximate Equilibria in Bimatrix Gamesarticle · 4 shared references 2006Finding equilibria in large sequential games of imperfect informationother · 4 shared references 2013On the Complexity of Approximating a Nash Equilibriumarticle · 3 shared references

Details

Year2007

Typeother

Published2007-12-03

VenueSpringer eBooks

Languageen

Citations53

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

doi10.1007/978-3-540-77105-0_9

openalex_workW1510190958

Links

Imported from OpenAlex (CC0) — nothing here is generated.