Identify the Nash Equilibrium in Static Games with Random Payoffs

No abstract is available for this paper.

• Publication year

  2017

• Venue

  International Conference on Machine Learning

• Publication date

  2017-07-17

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Best arm identification in multi-armed bandits with delayed feedback

  2018cited by this paper
• Maximin Action Identification: A New Bandit Framework for Games

  2016cited by this paper
• Best-arm identification algorithms for multi-armed bandits in the fixed confidence setting

  2014cited by this paper
• Query complexity of approximate equilibria in anonymous games

  2014cited by this paper
• On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models

  2014influential reference
• Bounds for the query complexity of approximate equilibria

  2014cited by this paper
• Finding approximate nash equilibria of bimatrix games via payoff queries

  2013cited by this paper
• Learning equilibria of games via payoff queries

  2013cited by this paper
• Query complexity of approximate nash equilibria

  2013cited by this paper
• The Query Complexity of Correlated Equilibria

  2013cited by this paper
• PAC Subset Selection in Stochastic Multi-armed Bandits

  2012influential reference
• Introduction to Nonparametric Estimation

  2008cited by this paper
• Searching for approximate equilibria in empirical games

  2008cited by this paper
• Settling the complexity of computing two-player Nash equilibria

  2007cited by this paper
• The complexity of computing a Nash equilibrium

  2006cited by this paper
• Methods for Empirical Game-Theoretic Analysis

  2006cited by this paper
• Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems

  2006influential reference
• Learning payoff functions in infinite games

  2005cited by this paper
• The Sample Complexity of Exploration in the Multi-Armed Bandit Problem

  2004cited by this paper
• Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium

  2003cited by this paper
• Finite-time Analysis of the Multiarmed Bandit Problem

  2002influential reference
• The Racing Algorithm: Model Selection for Lazy Learners

  1997cited by this paper
• A Course in Game Theory

  1995cited by this paper
• Asymptotically efficient adaptive allocation rules

  1985cited by this paper

• Decentralized Multi-product Pricing: Diagonal Dominance, Nash Equilibrium, and Price of Anarchy

  2026cites this paper
• Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback

  2025cites this paper
• Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits

  2025cites this paper
• A Game-theoretic Framework for Privacy-preserving Federated Learning

  2023influential citation
• Approximating Nash Equilibria in Normal-Form Games via Stochastic Optimization

  2023cites this paper
• Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits

  2023influential citation
• A Game-theoretic Framework for Federated Learning

  2023cites this paper
• Bounding Regret in Empirical Games

  2020cites this paper
• Non-Asymptotic Pure Exploration by Solving Games

  2019cites this paper
• Pure Exploration with Multiple Correct Answers

  2019cites this paper
• Multiagent Evaluation under Incomplete Information

  2019cites this paper
• Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervals

  2018cites this paper
• Inferring Users ’ Choice Functions in Networked Social Systems Through Active Queries

  2018cites this paper