Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6892616 | Computers & Operations Research | 2018 | 12 Pages |
Abstract
In so-called random preference models of probabilistic choice, a decision maker chooses according to an unspecified probability distribution over preference states. The most prominent case arises when preference states are linear orders or weak orders of the choice alternatives. The literature has documented that actually evaluating whether decision makers' observed choices are consistent with such a probabilistic model of choice poses computational difficulties. This severely limits the possible scale of empirical work in behavioral economics and related disciplines. We propose a family of column generation based algorithms for performing such tests. We evaluate our algorithms on various sets of instances. We observe substantial improvements in computation time and conclude that we can efficiently test substantially larger data sets than previously possible.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Bart Smeulders, Clintin Davis-Stober, Michel Regenwetter, Frits C.R. Spieksma,