ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2305.17805
  4. Cited By
The Computational Complexity of Single-Player Imperfect-Recall Games

The Computational Complexity of Single-Player Imperfect-Recall Games

28 May 2023
Emanuel Tewolde
Caspar Oesterheld
Vincent Conitzer
Paul W. Goldberg
ArXiv (abs)PDFHTML

Papers citing "The Computational Complexity of Single-Player Imperfect-Recall Games"

2 / 2 papers shown
Title
A dataset of questions on decision-theoretic reasoning in Newcomb-like problems
A dataset of questions on decision-theoretic reasoning in Newcomb-like problems
Caspar Oesterheld
Emery Cooper
Miles Kodama
Linh Chi Nguyen
Ethan Perez
146
1
0
15 Nov 2024
Imperfect-Recall Games: Equilibrium Concepts and Their Complexity
Imperfect-Recall Games: Equilibrium Concepts and Their Complexity
Emanuel Tewolde
B. Zhang
Caspar Oesterheld
Manolis Zampetakis
Tuomas Sandholm
Paul W. Goldberg
Vincent Conitzer
56
5
0
23 Jun 2024
1