ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1109.3607
  4. Cited By
Subtree perfectness, backward induction, and normal-extensive form
  equivalence for single agent sequential decision making under arbitrary
  choice functions

Subtree perfectness, backward induction, and normal-extensive form equivalence for single agent sequential decision making under arbitrary choice functions

16 September 2011
Nathan Huntley
Matthias C. M. Troffaes
ArXiv (abs)PDFHTML

Papers citing "Subtree perfectness, backward induction, and normal-extensive form equivalence for single agent sequential decision making under arbitrary choice functions"

3 / 3 papers shown
Reciprocal Learning
Reciprocal LearningNeural Information Processing Systems (NeurIPS), 2024
Julian Rodemann
Christoph Jansen
G. Schollmeyer
FedML
344
0
0
12 Aug 2024
Identifying subtree perfectness in decision trees
Identifying subtree perfectness in decision trees
Nathan Huntley
Matthias C. M. Troffaes
119
0
0
06 Aug 2012
Normal form backward induction for decision trees with coherent lower
  previsions
Normal form backward induction for decision trees with coherent lower previsions
Nathan Huntley
Matthias C. M. Troffaes
255
15
0
01 Apr 2011
1
Page 1 of 1