Journal ArticleComputers and Mathematics with Applications · September 1, 2005
This paper presents algorithms for finding equilibria of mixed strategy in multistage noncooperative games of incomplete information (like probabilistic blindfold chess, where at every opportunity a player can perform different moves with some probability) ...
Full textCite
Journal ArticleComputers and Mathematics with Applications · January 1, 2002
Extending the complexity results of Reif [1,2] for two player games of incomplete information, this paper (see also [3]) presents algorithms for deciding the outcome for various classes of multiplayer games of incomplete information, i.e., deciding whether ...
Full textCite
Journal ArticleComputers and Mathematics with Applications · January 1, 2001
This paper extends the alternating Turing machine (A-TM) of Chandra, Kozen and Stockmeyer, the private and the blind alternating machines of Reif to model multiplayer games of incomplete information. We use these machines to provide matching lower bounds f ...
Full textCite
Journal ArticleComputers and Mathematics with Applications · January 1, 1999
This paper discusses learning algorithms for ascertaining membership, inclusion, and equality in permutation groups. The main results are randomized learning algorithms which take a random generator set of a fixed group G≤Sn as input. We discuss randomized ...
Full textCite
Journal ArticleProceedings of the Data Compression Conference · January 1, 1994
This paper presents advanced data compression techniques for predicting stock markets behavior under widely accepted market models in finance. Our techniques are applicable to technical analysis, portfolio theory, and nonlinear market models. We find that ...
Cite
