paper-with-me

홈 › Papers

Learning Tree Structured Potential Games

2016-12-01 · NeurIPS 2016 12 · Vikas Garg, Tommi Jaakkola

Many real phenomena, including behaviors, involve strategic interactions that can be learned from data. We focus on learning tree structured potential games where equilibria are represented by local maxima of an underlying potential function. We cast the learning problem within a max margin setting and show that the problem is NP-hard even when the strategic interactions form a tree. We develop a variant of dual decomposition to estimate the underlying game and demonstrate with synthetic and real decision/voting data that the game theoretic perspective (carving out local maxima) enables meaningful recovery.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Beyond Games: A Systematic Review of Neural Monte Carlo Tree Search Applications

2023-03-14 · Marco Kemmerling, Daniel Lütticke, Robert H. Schmitt

The advent of AlphaGo and its successors marked the beginning of a new paradigm in playing games using artificial intelligence. This was achieved by combining Monte Carlo tree search, a planning procedure, and deep learn…

Articles

Introduction to Behavior Algorithms for Fighting Games

2020-07-06 · Ignacio Gajardo, Felipe Besoain, Nicolas A. Barriga

The quality of opponent Artificial Intelligence (AI) in fighting videogames is crucial. Some other game genres can rely on their story or visuals, but fighting games are all about the adversarial experience. In this pape…

Competing in a Complex Hidden Role Game with Information Set Monte Carlo Tree Search

2020-05-14 · Jack Reinhardt

Advances in intelligent game playing agents have led to successes in perfect information games like Go and imperfect information games like Poker. The Information Set Monte Carlo Tree Search (ISMCTS) family of algorithms…

Biasing MCTS with Features for General Games

2019-03-21 · Dennis J. N. J. Soemers, Éric Piette, Cameron Browne

This paper proposes using a linear function approximator, rather than a deep neural network (DNN), to bias a Monte Carlo tree search (MCTS) player for general games. This is unlikely to match the potential raw playing st…

Board Games

Deduction Game Framework and Information Set Entropy Search

2024-07-30 · Fandi Meng, Simon Lucas

We present a game framework tailored for deduction games, enabling structured analysis from the perspective of Shannon entropy variations. Additionally, we introduce a new forward search algorithm, Information Set Entrop…

Decision Making