Sciweavers

Share
TCIAIG
2010

The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model

9 years 5 months ago
The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory for a fingerprinting operator which returns the length-weighted probability of a given move pair occurring from playing the investigated agent against a general parametrized probabilistic finite-state transducer (PFT) is developed, applicable to arbitrary iterated games. Results for the distinguishing power of the 1-state opponent model, uniform approximability of fingerprints of arbitrary players, analyticity and Lipschitz continuity of fingerprints for logically possible players, and equicontinuity of the fingerprints of bounded-state probabilistic transducers are derived. Algorithms for the efficient computation of special instances are given; the shortcomings of a previous model, strictly generalized here from a simple projection of the new model, are explained in terms of regularity condition violations,...
Jeffrey Tsang
Added 21 May 2011
Updated 21 May 2011
Type Journal
Year 2010
Where TCIAIG
Authors Jeffrey Tsang
Comments (0)
books