Supplemental Material for A Bayesian Approach to Discriminating Between Biased Responding and Sequential Dependencies in Binary Choice Data

Decision ◽  
2016 ◽  
Keyword(s):  
Bayesian Approach ◽  
Binary Choice ◽  
Choice Data ◽  
Sequential Dependencies ◽  
Biased Responding

A Bayesian approach to the spatial representation of market structure from consumer choice data

1998 ◽  
Vol 111 (2) ◽  
pp. 285-305 ◽  
Author(s):  
Wayne S. DeSarbo ◽  
Youngchan Kim ◽  
Michel Wedel ◽  
Duncan K.H. Fong
Keyword(s):  
Market Structure ◽  
Bayesian Approach ◽  
Consumer Choice ◽  
Spatial Representation ◽  
Choice Data

scholarly journals An Integrated Approach to the Analysis of Binary Choice Data

1982 ◽  
Vol 6 (1) ◽  
pp. 31-40
Author(s):  
W. Cermak ◽  
J. Lieberman ◽  
Harold P. Benson
Keyword(s):  
Integrated Approach ◽  
Binary Choice ◽  
Choice Data

Unfolding Analysis of Binary Choice Data

2020 ◽  
pp. 129-180
Author(s):  
David A. Armstrong ◽  
Ryan Bakker ◽  
Royce Carroll ◽  
Christopher Hare ◽  
Keith T. Poole ◽  
...  
Keyword(s):  
Binary Choice ◽  
Choice Data ◽  
Unfolding Analysis

scholarly journals Nonparametric Unfolding of Binary Choice Data

2000 ◽  
Vol 8 (3) ◽  
pp. 211-237 ◽  
Author(s):  
Keith T. Poole
Keyword(s):  
Rank Order ◽  
Binary Choice ◽  
Choice Data ◽  
Data Set ◽  
Maximum Score ◽  
Rank Order Data ◽  
Binary Choices ◽  
Primary Focus ◽  
Linear Probability

This paper shows a general nonparametric unfolding technique for maximizing the correct classification of binary choice or two-category data. The motivation for and the primary focus of the unfolding technique are parliamentary roll call voting data. However, the procedures that implement the unfolding also can be applied to the problem of unfolding rank order data as well as analyzing a data set that would normally be the subject of a probit, logit, or linear probability analysis. One aspect of the scaling method greatly improves Manski's “maximum score estimator” technique for estimating limited dependent variable models. To unfold binary choice data two subproblems must be solved. First, given a set of chooser or legislator points, a cutting plane must be found such that it divides the legislators/choosers into two sets that reproduce the actual choices as closely as possible. Second, given a set of cutting planes for the binary choices, a point for each chooser or legislator must be found which reproduces the actual choices as closely as possible. Solutions for these two problems are shown in this paper. Monte Carlo tests of the procedure show it to be highly accurate in the presence of voting error and missing data.

Sign in / Sign up

Export Citation Format

Share Document