The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new

Abstract not found

www.people.cornell.edu/pages/edo1/.

ABSTRACT: Affect is considered by most contempo-rary theories to be postcognitive, that is, to occur only after considerable cognitive operations have been ac-complished. Yet a number of experimental results on preferences, attitudes, impression formation, and de-_ cision making, as well as some

), which approximate the posterior under a common Bayesian formulation of the localization problem. Building on the basic MCL algorithm, this article develops a more robust algorithm called MixtureMCL, which integrates two complimentary ways of generating samples in the estimation. To apply this algorithm

the policymaker and the private agents, it is possible that reputational forces can substitute for formal rules. Here, we develop an example of a reputational equilibrium where the outcomes turn out to be weighted averages of those from discretion and those from the ideal rule. In particular, the rates

Abstract not found

This paper reports measures of preference parameters relating to risk tolerance, time preference, and intertemporal substitution. These measures are based on survey responses to hypothetical situations constructed using an economic theorist's concept of the underlying parameters

We demonstrate that a simple model, constructed on the premise that people are motivated by both their pecuniary payoff and their relative payoff standing, explains behavior in a wide variety of laboratory games. Included are games where equity is thought to be a factor, such as ultimatum, two

This paper considers mixed, or random coefficients, multinomial logit (MMNL) models for discrete response, and establishes the following results: Under mild regularity conditions, any discrete choice model derived from random utility maximization has choice probabilities that can be approximated