All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

17 813 (0,12s)

Result

Online Monte Carlo Counterfactual Regret Minimization for Search in Imperfect Information Games

presentOnline Outcome Sampling, an online search variant of Monte Carlo Counterfactual Regret Minimization, which preserves its convergence to Nash equilibrium. We show......

IN - Informatika

  • 2015
  • D
  • Link
Result

Learning not to regret

not to regret" framework, enabling us to meta-learn a regret minimizer tailored to a specific distribution. Our key contribution, Neural Predictive Regret Matching having regret minimization guar...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2024
  • D
  • Link
Result

Intelligence, not Integration:Distributed Regret Minimization for IDS Control

We present an empirical study of regret minimization procedure used in a distributed Intrusion Detection System (IDS) to independently adapt the self-contained components of the system without any explicit coordination. We show that...

JC - Počítačový hardware a software

  • 2011
  • D
  • Link
Result

Automated Construction of Bounded-loss Imperfect-recall Abstractions in Extensive-form Games

, FPIRA and CFR+IRA, based on fictitious play and counterfactual regret minimization...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2020
  • Jimp
  • Link
Result

Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games

and strategies computed by Counterfactual regret minimization (CFR) and Monte-Carlo tree...

IN - Informatika

  • 2015
  • D
  • Link
Result

Monte Carlo Continual Resolving for Online Strategy Computation in Imperfect Information Games

and implement its Monte Carlovariant (MCCR) which uses Monte Carlo Counterfactual...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2019
  • D
  • Link
Result

No-Regret Learning Supports Voters’ Competence

in hindsight. The difference represents the regret of meta-induction whose minimization their standing in democratic theory contested. We show that a type of no-regret learning the level of their inclusion in recommendatio...

Political science

  • 2024
  • Jimp
  • Link
Result

On the Value of Coordination in Distributed Self-Adaptation of Intrusion Detection System

. We show that theuse of regret minimization techniques results in stable...

JC - Počítačový hardware a software

  • 2011
  • D
Result

Search in Imperfect Information Games Using Online Monte Carlo Counterfactual Regret Minimization

Online search in games has always been a core interest of artificial intelligence. Advances made in search for perfect information games (such as Chess, Checkers, Go, and Backgammon) have led to AI capable of defeating the world's top human experts. ...

IN - Informatika

  • 2014
  • O
  • Link
Result

Effectiveness of Game-Theoretic Strategies in Extensive-Form General-Sum Games

of solution-concept strategies and strategies computed by Counterfactual regret minimization (CFR) and Monte Carlo Tree Search in practice. Our results show that (1) CFR......

IN - Informatika

  • 2015
  • O
  • 1 - 10 out of 17 813