Sciweavers

    7 search results - page 2 / 2
    » Gradient-Based Algorithms for Finding Nash Equilibria in Ext...
    Sort
    View
    AAAI
    2012
    249views Intelligent Agents» more  AAAI 2012»
    Generalized Sampling and Variance in Counterfactual Regret Minimization
    11 years 7 months ago
    Generalized Sampling and Variance in Counterfactual Regret Minimization
    Download  poker.cs.ualberta.ca
    In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
    Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
    claim paper
    Read More »
    JACM
    2007
    160views more  JACM 2007»
    Lossless abstraction of imperfect information games
    13 years 5 months ago
    Lossless abstraction of imperfect information games
    Download  www.cs.cmu.edu
    abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
    Andrew Gilpin, Tuomas Sandholm
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.