A "dispersion" specifies the relative probability between any two elements of a finite domain. It thereby partitions the domain into equivalence classes separated by infinite relative probability. The paper's novelty is to numerically represent not only the order of the equivalence classes, but also the "magnitude" of the gaps between them. The paper's main theorem is that the many products of two dispersions are characterized algebraically by varying the magnitudes of the gaps between each factor's equivalence classes. An immediate corollary is that the many beliefs consistent with two strategies are characterized by varying each player's "steadiness" in avoiding various zero-probability options
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Find related papers by JEL classification: C60 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - General C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
This paper has been announced in the following NEP Reports:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)