Using Regret Estimation to Solve Games Compactly

First Page		Document Content
Date: 2016-04-19 16:33:23 Game theory Academia Abstraction Mathematics Solved game Mathematical game Computational complexity theory Mathematical problem Nash equilibrium Regression analysis Extensive-form game		Using Regret Estimation to Solve Games Compactly Add to Reading List Source URL: poker.cs.ualberta.ca Download Document from Source Website File Size: 1,19 MB Share Document on Facebook

	A Cooperative Network Game Efficiently Solved via an Ant Colony Optimization Approach Pablo Romero1 , Franco Robledo1 Pablo Rodr´ıguez-Bocca1 , Dar´ıo Padula1 , and Mar´ıa Elisa Bertinat1 Facultad de Ingenier´ıa, DocID: 1suGU - View Document
	Paranoid Proof-Number Search Jahn-Takeshi Saito and Mark H.M. Winands Abstract— Over the years, an increasing number of twoplayer games has been added to the list of solved games. However, solving multi-player games ha DocID: 1nyos - View Document
	Using Regret Estimation to Solve Games Compactly DocID: 1nsR0 - View Document
	Non-optimal Multi-Agent Pathfinding is Solved (SinceGabriele R¨oger and Malte Helmert University of Basel, Switzerland {gabriele.roeger,malte.helmert}@unibas.ch Abstract DocID: 18VVZ - View Document
	Non-optimal Multi-Agent Pathfinding is Solved (SinceGabriele R¨oger and Malte Helmert University of Basel, Switzerland {gabriele.roeger,malte.helmert}@unibas.ch Abstract DocID: 18j94 - View Document