Games, complexity classes, and approximation algorithms.

zbMATH Open1034.68521MaRDI QIDQ1126837FDOQ1126837

Authors: Joan Feigenbaum 

Publication date: 5 August 1998

Published in: Documenta Mathematica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/222677

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Playing Games with Approximation Algorithms
• scientific article; zbMATH DE number 5605130
• The approximation complexity of win-lose games
• Recent results and questions in combinatorial game complexities
• Approximation algorithms for unique games
• The complexity of solving stochastic games on graphs
• Mathematical Foundations of Computer Science 2005
• scientific article; zbMATH DE number 1342211

zbMATH Keywords

perfect informationperfect recall

Mathematics Subject Classification ID

Game theory (91A99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (2)

• Games against nature
• Playing Games with Approximation Algorithms

This page was built for publication: Games, complexity classes, and approximation algorithms.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126837)