International audienceZero-sum games with incomplete information are formulated as linear programs in which the players' behavioral strategies appear as primal and dual variables. Known properties for these games may then be derived from duality theory
In this paper, we introduce plan-time sufficient statistics, representing probability distributions ...
In 1951, Dantzig showed the equivalence of linear programming problems and two-person zero-sum games...
Includes bibliographical references (page 61)This paper is a study of the related mathematical subje...
International audienceZero-sum games with incomplete information are formulated as linear programs i...
Zero-sum games with incomplete information are formulated as linear programs in which the players' ...
Scholz RW. Sequential two person zero sum games with incomplete information and incidental sequence ...
International audienceThis paper gives the LP formulation for finite zero sum games with incomplete ...
Koller, Megiddo and von Stengel showed how to efficiently compute minimax strategies for two-player ...
The recursive formula for the value of the zero-sum repeated games with incomplete information on bo...
Duality and optimal strategies in the finitely repeated zero-sum games with incomplete information o...
URL des Cahiers :<br />http://mse.univ-paris1.fr/MSEFramCahier2005.htmCahiers de la Maison des Scien...
Using the duality techniques introduced by De Meyer (Math Oper Res 21:209–236, 1996a, Math Oper Res ...
International audienceIn games with incomplete information, the players' states of information may b...
International audienceWe study zero-sum games with incomplete information and analyze the impact tha...
International audienceWe present a simple projection-free primal-dual algorithm for computing approx...
In this paper, we introduce plan-time sufficient statistics, representing probability distributions ...
In 1951, Dantzig showed the equivalence of linear programming problems and two-person zero-sum games...
Includes bibliographical references (page 61)This paper is a study of the related mathematical subje...
International audienceZero-sum games with incomplete information are formulated as linear programs i...
Zero-sum games with incomplete information are formulated as linear programs in which the players' ...
Scholz RW. Sequential two person zero sum games with incomplete information and incidental sequence ...
International audienceThis paper gives the LP formulation for finite zero sum games with incomplete ...
Koller, Megiddo and von Stengel showed how to efficiently compute minimax strategies for two-player ...
The recursive formula for the value of the zero-sum repeated games with incomplete information on bo...
Duality and optimal strategies in the finitely repeated zero-sum games with incomplete information o...
URL des Cahiers :<br />http://mse.univ-paris1.fr/MSEFramCahier2005.htmCahiers de la Maison des Scien...
Using the duality techniques introduced by De Meyer (Math Oper Res 21:209–236, 1996a, Math Oper Res ...
International audienceIn games with incomplete information, the players' states of information may b...
International audienceWe study zero-sum games with incomplete information and analyze the impact tha...
International audienceWe present a simple projection-free primal-dual algorithm for computing approx...
In this paper, we introduce plan-time sufficient statistics, representing probability distributions ...
In 1951, Dantzig showed the equivalence of linear programming problems and two-person zero-sum games...
Includes bibliographical references (page 61)This paper is a study of the related mathematical subje...
DOI
Add to ORKG