Show simple item record

Aggregating probabilistic beliefs: Market mechanisms and graphical representations.

dc.contributor.authorPennock, David M.
dc.contributor.advisorWellman, Michael P.
dc.date.accessioned2016-08-30T18:00:48Z
dc.date.available2016-08-30T18:00:48Z
dc.date.issued1999
dc.identifier.urihttp://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9959840
dc.identifier.urihttps://hdl.handle.net/2027.42/132223
dc.description.abstractA long-standing question in statistics is how best to aggregate the probabilistic beliefs of multiple agents. Related is the practical question of how to represent the combined beliefs efficiently. This dissertation reports contributions on both fronts. First, I formulate and analyze a securities market mechanism for aggregating beliefs. Equilibrium prices in the market are interpreted as consensus beliefs. Under homogeneity conditions regarding agents' utilities, the market mechanism corresponds with standard aggregation functions, and the market's outward behavior is indistinguishable from that of an individual. I also explore extensions to the model in which agents learn from prices and the market as a whole adapts over time. In certain circumstances, price fluctuations can be viewed as the Bayesian updates of a rational individual. Second, I investigate the use of graphical models, and in particular Bayesian networks, for representing aggregate beliefs. I derive two impossibility theorems which contradict widely held intuitions about how Bayesian networks should be combined. The so-called logarithmic opinion pool is shown to admit relatively concise encodings. I describe the nature of graphical structures consistent with this pooling function, and give algorithms for computing the logarithmic and linear opinion pools with, in some cases, exponential speedups over standard methods. Finally, I apply and extend the graphical modeling results to the market framework, deriving sufficient conditions for compact markets to be operationally complete. Such markets still induce a complete consensus distribution and support Pareto optimal allocations of risk, but with exponentially fewer securities than required for traditional completeness.
dc.format.extent129 p.
dc.languageEnglish
dc.language.isoEN
dc.subjectAggregating
dc.subjectBayesian
dc.subjectBelief Aggregation
dc.subjectGraphical Representations
dc.subjectMarket Mechanisms
dc.subjectProbabilistic Beliefs
dc.subjectSecurities Markets
dc.titleAggregating probabilistic beliefs: Market mechanisms and graphical representations.
dc.typeThesis
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineApplied Sciences
dc.description.thesisdegreedisciplineComputer science
dc.description.thesisdegreedisciplineFinance
dc.description.thesisdegreedisciplinePure Sciences
dc.description.thesisdegreedisciplineSocial Sciences
dc.description.thesisdegreedisciplineStatistics
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studies
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/132223/2/9959840.pdf
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.