About: Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://ijcai.org/papers13/contents.php
Description	We focus on solving two-player zero-sum extensive-form games with perfect information and simultaneous moves. In these games, both players fully observe the current state of the game where they simultaneously make a move determining the next state of the game. We solve these games by a novel algorithm that relies on two components: (1) it iteratively solves the games that correspond to a single simultaneous move using a double-oracle method, and (2) it prunes the states of the game using bounds on the sub-game values obtained by the classical Alpha-Beta search on a serialized variant of the game. We experimentally evaluate our algorithm on the Goofspiel card game, a pursuit-evasion game, and randomly generated games. The results show that our novel algorithm typically provides significant running-time improvements and reduction in the number of evaluated nodes compared to the full search algorithm. We focus on solving two-player zero-sum extensive-form games with perfect information and simultaneous moves. In these games, both players fully observe the current state of the game where they simultaneously make a move determining the next state of the game. We solve these games by a novel algorithm that relies on two components: (1) it iteratively solves the games that correspond to a single simultaneous move using a double-oracle method, and (2) it prunes the states of the game using bounds on the sub-game values obtained by the classical Alpha-Beta search on a serialized variant of the game. We experimentally evaluate our algorithm on the Goofspiel card game, a pursuit-evasion game, and randomly generated games. The results show that our novel algorithm typically provides significant running-time improvements and reduction in the number of evaluated nodes compared to the full search algorithm. (en)
Title	Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games (en)
skos:prefLabel	Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games (en)
skos:notation	RIV/68407700:21230/13:00213277!RIV14-GA0-21230___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GAP202/12/2054)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Vítek, Roman Čermák, Jiří Pěchouček, Michal Bošanský, Branislav Lisý, Viliam
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	113110
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/13:00213277
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	game theory; simultaneous move games; iterative algorithms (en)
http://linked.open.../riv/klicoveSlovo	iterative algorithms simultaneous move games game theory
http://linked.open...ontrolniKodProRIV	[BA2AF7A2CB4E]
http://linked.open...v/mistoKonaniAkce	Beijing
http://linked.open...i/riv/mistoVydani	Menlo Park, California
http://linked.open...i/riv/nazevZdroje	Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	5 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (xsd:int)
http://linked.open...vavai/riv/projekt	Bezpečnostní hry v extenzivní formě
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Bošanský, Branislav Lisý, Viliam Pěchouček, Michal Vítek, Roman Čermák, Jiří
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-08-03 (xsd:date)
number of pages	7 (xsd:int)
http://purl.org/ne...btex#hasPublisher	AAAI Press
https://schema.org/isbn	978-1-57735-633-2
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 100 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software