TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Regret Minimization in Games with Incomplete Information (CFR)

88 pointsby vpjalmost 4 years ago

5 comments

pierrefermat1almost 4 years ago
The annotation style is really incredibly intuitive to read!
评论 #27593359 未加载
评论 #27596520 未加载
kevinwangalmost 4 years ago
Cool! I still find this 2013 tutorial to be the best educational resource for CFR that I&#x27;ve seen: <a href="http:&#x2F;&#x2F;modelai.gettysburg.edu&#x2F;2013&#x2F;cfr&#x2F;cfr.pdf" rel="nofollow">http:&#x2F;&#x2F;modelai.gettysburg.edu&#x2F;2013&#x2F;cfr&#x2F;cfr.pdf</a>
dragontameralmost 4 years ago
This was always a subject I was interested in, ever since those AI Poker players beat the human experts.<p>I&#x27;ve saved this. I&#x27;ll have to spend some time actively studying this incredible breakthrough in AI.
reidjsalmost 4 years ago
The moment I start seeing the Greek symbols my brain turns off. But I’m super interested in game theory and this concept. Than someone dumb this paper down for people like me?
评论 #27595531 未加载
评论 #27593518 未加载
评论 #27593166 未加载
slt2021almost 4 years ago
is it the same algo from CMU that beat pro players in heads up NL holdem?
评论 #27593552 未加载