Los puntos clave no están disponibles para este artículo en este momento.
Abstract We present a new characterization of MACE in terms of problems in a classical area in optimization, decision-making under uncertainty. These problems are modeled by certain games played against a disinterested opponent who makes moves at random. We show several natural problems of this sort to be MACE-complete.
Building similarity graph...
Analyzing shared references across papers
Christos H. Papadimitriou (Tue,) studied this question.
Loading...
Stanford University
Add This Paper to Your Research Feed
Any time a new paper drops it will be there.