Compute Choice
نویسنده
چکیده
In this talk, we shall discuss the question of learning distribution over permutations of n choices based on partial observations. This is central to capturing the so called “choice” in a variety of contexts: understanding preferences of consumers over a collection of products based on purchasing and browsing data in the setting of retail and e-commerce, learning public opinion amongst a collection of socio-economic issues based on sparse polling data, and deciding a ranking of teams or players based on outcomes of games. The talk will primarily discuss the relationship between the ability to learn, nature of partial information and number of available observations. Connections to the classical theory of social choice and behavioral psychology, as well as modern literature in Statistics, learning theory and operations research will be discussed. 1998 ACM Subject Classification F. Theory of Computation
منابع مشابه
The Delta Method to Compute Confidence Intervals of Predictions from Discrete Choice Model: An Application to Commute Mode Choice Model
متن کامل
Un ) Conditional Distribution of Compensating Variation in Discrete Choice Models
For a large class of additive random utility discrete choice models with income effects, we compute the probability distribution of the compensating variation. We show that the cumulative distribution function only depends on the choice probabilities. Our results are used to compute the distribution of equivalent variation. The moments of the compensating variation are a onedimensional integral...
متن کاملExtremal Throughputs in Free-Choice Nets
We give a method to compute the throughput in a timed live and bounded free-choice Petri net under a total allocation (i.e. a 0-1 routing). We also characterize and compute the conflict-solving policies that achieve the smallest throughput in the special case of a 1-bounded net. They do not correspond to total allocations, but still have a small period.
متن کاملThe Profile Structure for Luce’s Choice Axiom
A geometric approach is introduced to explain phenomena that can arise with Luce’s choice axiom; e.g., differences occur when determining the likelihood of a ranking by starting with the “best-first,” or “worst-first” alternative. As shown, the problem is caused by the way we compute pairwise probabilities: it forces “bestfirst” and “worst-first” computations to use different information from a...
متن کاملA Convex Optimization Approach for Computing Correlated Choice Probabilities with Many Alternatives∗
A popular discrete choice model that incorporates correlation information is the Multinomial Probit (MNP) model where the random utilities of the alternatives are chosen from a multivariate normal distribution. Computing the choice probabilities is challenging in the MNP model when the number of alternatives is large and simulation is a popular technique used to approximate the choice probabili...
متن کاملVoting by Eliminating Quantifiers
Mathematical theory of voting and social choice has attracted much attention. In the general setting one can view social choice as a method of aggregating individual, often conflicting preferences and making a choice that is the best compromise. How preferences are expressed and what is the “best compromise” varies and heavily depends on a particular situation. The method we propose in this pap...
متن کامل