Simple models for multi-attribute choice with many alternatives: When it does and does not pay to face tradeoffs with binary attributes

Working Paper no longer available. Please contact the author.

Take-the-best and other simple strategies: Why and when they work 'well' in binary choice

The effectiveness of decision rules depends on characteristics of bothrules and environments. A theoretical analysis of environments specifiesthe relative predictive accuracies of the lexicographic rule 'take-the-best'(TTB) and other simple strategies for binary choice. We identify threefactors: how the environment weights variables; characteristics of choicesets; and error. For cases involving from three to five binary cues, TTBis effective across many environments. However, hybrids of equal weights(EW) and TTB models are more effective as environments become morecompensatory. In the presence of error, TTB and similar models do not predictmuch better than a naïve model that exploits dominance. We emphasizepsychological implications and the need for more complete theories of theenvironment that include the role of error.

Cumulative dominance and heuristic performance in binary multi-attribute choice

Several studies have reported high performance of simple decision heuristics multi-attribute decision making. In this paper, we focus on situations where attributes are binary and analyze the performance of Deterministic-Elimination-By-Aspects (DEBA) and similar decision heuristics. We consider non-increasing weights and two probabilistic models for the attribute values: one where attribute values are independent Bernoulli randomvariables; the other one where they are binary random variables with inter-attribute positive correlations. Using these models, we show that good performance of DEBA is explained by the presence of cumulative as opposed to simple dominance. We therefore introduce the concepts of cumulative dominance compliance and fully cumulative dominance compliance and show that DEBA satisfies those properties. We derive a lower bound with which cumulative dominance compliant heuristics will choose a best alternative and show that, even with many attributes, this is not small. We also derive an upper bound for the expected loss of fully cumulative compliance heuristics and show that this is moderateeven when the number of attributes is large. Both bounds are independent of the values ofthe weights.

Computation of multiple correspondence analysis, with code in R

The generalization of simple correspondence analysis, for two categorical variables, to multiple correspondence analysis where they may be three or more variables, is not straighforward, both from a mathematical and computational point of view. In this paper we detail the exact computational steps involved in performing a multiple correspondence analysis, including the special aspects of adjusting the principal inertias to correct the percentages of inertia, supplementary points and subset analysis. Furthermore, we give the algorithm for joint correspondence analysis where the cross-tabulations of all unique pairs of variables are analysed jointly. The code in the R language for every step of the computations is given, as well as the results of each computation.

Implementing TURF analysis through binary linear programming

This paper introduces the approach of using Total Unduplicated Reach and Frequency analysis (TURF) to design a product line through a binary linear programming model. This improves the efficiency of the search for the solution to the problem compared to the algorithms that have been used to date. The results obtained through our exact algorithm are presented, and this method shows to be extremely efficient both in obtaining optimal solutions and in computing time for very large instances of the problem at hand. Furthermore, the proposed technique enables the model to be improved in order to overcome the main drawbacks presented by TURF analysis in practice.

Le code noir : opéra-comique en trois actes / paroles de M. E. Scribe, musique de M. Clapisson...

Collection : Répertoire dramatique des auteurs contemporains ; N° 212

Report on applying agreed-upon procedures to the City of Protivin’s certification of compliance with Chapter 388.10 of the Code of Iowa for the year ended June 30, 2008

Report on applying agreed-upon procedures to the City of Protivin’s certification of compliance with Chapter 388.10 of the Code of Iowa for the year ended June 30, 2008

Report on applying agreed-upon procedures to the City of Protivin’s certification of compliance with Chapter 388.10 of the Code of Iowa for the year ended June 30, 2007

Report on applying agreed-upon procedures to the City of Protivin’s certification of compliance with Chapter 388.10 of the Code of Iowa for the year ended June 30, 2007

Iowa Department of Transportation Fiscal Year 2008 Report of Savings by Using Video Conferencing Through Iowa Communications Network to the Iowa General Assembly Pursuant to Iowa Code § II 84 Acts and Joint Resolutions Enacted at the 1994 Regular Session of the 75th General Assembly of the State of Iowa Iowa Code §8D.10 Report of Savings by State Agencies

Iowa Code § 8D.10 requires certain state agencies prepare an annual report to the General Assembly certifying the identified savings associated with that state agency’s use of the Iowa Communications Network (ICN). This report covers estimated cost savings related to video conferencing via ICN for the Iowa Department of Transportation (DOT). In FY 2008, the DOT did not conduct any sessions utilizing ICN’s video conferencing system. Therefore, no cost savings were calculated for this report.