SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Efficient Computation of Equilibria for Extensive Two-Person Games
2 references·16 citing·40 second hop
Efficient Computation of Equilibria for Extensive Two-Person Games (1996)Efficient Computation of Equilibria for E…Nash and correlated equilibria: Some complexity considerations (1989)Nash and correlated equilibri…Equilibrium Points of Bimatrix Games (1964)Equilibrium Points of Bimatri…The Semantic Communication Game (2018)The Semantic Communication Ga…Patrolling security games: Definition and algorithms for solving large instances with single patroller and single intruder (2012)Patrolling security games: De…Smoothing Techniques for Computing Nash Equilibria of Sequential Games (2010)Smoothing Techniques for Comp…Homotopy methods to compute equilibria in game theory (2009)Homotopy methods to compute e…Computational complexity in additive hedonic games (2009)Computational complexity in a…New complexity results about Nash equilibria (2008)New complexity results about …Lossless abstraction of imperfect information games (2007)Lossless abstraction of imper…Pure Nash Equilibria: Hard and Easy Games (2005)Pure Nash Equilibria: Hard an…Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs (2004)Approximate Solutions for Par…Pure Nash Equilibria: Hard and Easy Games (2003)Pure Nash Equilibria: Hard an…Complexity of Mechanism Design (2002)Complexity of Mechanism DesignCostly valuation computation in auctions (2001)Costly valuation computation …Conditional Dominance, Rationalizability, and Game Forms (1998)Conditional Dominance, Ration…Representations and solutions for game-theoretic problems (1997)Representations and solutions…Efficient Computation of Behavior Strategies (1996)Efficient Computation of Beha…Chapter 2 Computation of equilibria in finite games (1996)Chapter 2 Computation of equi…Non-Cooperative Games (1951)Reexamination of the perfectness concept for equilibrium points in extensive games (1975)Signaling Games and Stable Equilibria (1987)Exploring bidding strategies for market-based scheduling (2003)Nashification and the Coordination Ratio for a Selfish Routing Game (2003)A solution to matching with preferences over colleagues (2006)COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)Multipart pricing of public goods (1971)Incentives in Teams (1973)Automated Mechanism Design: A New Application Area for Search Algorithms (2003)Markets come to bits: Evolution, computation and markomata in economic science (2007)Automated Online Mechanism Design and Prophet Inequalities (2018)Equilibrium points in n -person games (1950)Stochastic Games (1953)Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model (1967)Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game (2004)Learning and Approximating the Optimal Strategy to Commit To (2009)Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games (2010)Non-cooperative games (1989)An efficient heuristic approach for security against multiple adversaries (2007)Using Game Theory for Los Angeles Airport Security (2009)Theory of games and economic behavior (2019)Towards robotic assistants in nursing homes: Challenges and results (2003)Belief and truth in hypothesised behaviours (2016)Effects of trust-based decision making in disrupted supply chains (2020)Rethinking formal models of partially observable multiagent decision making (2021)On the Strategic Stability of Equilibria (1986)Subjectivity and correlation in randomized strategies (1974)Playing large games using simple strategies (2003)Intrinsic robustness of the price of anarchy (2009)The complexity of computing a Nash equilibrium (2009)A Course in Game Theory (1994)Games with Incomplete Information Played by “Bayesian” Players, I–III: Part I. The Basic Model (2004)A class of games possessing pure-strategy Nash equilibria (1973)The Computational Complexity of Nash Equilibria in Concisely Represented Games (2005)Action-Graph Games (2010)Convergent Learning Algorithms for Unknown Reward Games (2013)The Core of an N Person Game (1967)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)The Complexity of Computing a Nash Equilibrium (2009)
this work references cited by second hop

References

  • 1964Equilibrium Points of Bimatrix Games1,246 cited
  • 1989Nash and correlated equilibria: Some complexity considerations406 cited

Cited by

  • 2002Complexity of Mechanism Design251 cited
  • 2008New complexity results about Nash equilibria212 cited
  • 1996Efficient Computation of Behavior Strategies199 cited
  • 1997Representations and solutions for game-theoretic problems180 cited
  • 2004Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs165 cited
  • 1996Chapter 2 Computation of equilibria in finite games160 cited
  • 2018The Semantic Communication Game151 cited
  • 2003Pure Nash Equilibria: Hard and Easy Games142 cited
  • 2012Patrolling security games: Definition and algorithms for solving large instances with single patroller and single intruder135 cited
  • 2010Smoothing Techniques for Computing Nash Equilibria of Sequential Games129 cited
  • 2009Homotopy methods to compute equilibria in game theory104 cited
  • 2007Lossless abstraction of imperfect information games94 cited
  • 1998Conditional Dominance, Rationalizability, and Game Forms92 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

  • 2005Pure Nash Equilibria: Hard and Easy Games91 cited
  • 2001Costly valuation computation in auctions89 cited
  • 2009Computational complexity in additive hedonic games83 cited