Sources of complexity in subset choice

Journal of Mathematical Psychology

Volumn 49, Issue 2, 2005, Pages 160-187

  van Rooij, Iris ^a   Stege, Ulrike ^b   Kadlec, Helena ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Algorithms; Computational complexity; Decision making; Fixed parameter tractable; Intractability; NP completeness; Subset choice

Indexed keywords

EID: 17044389355     PISSN: 00222496     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jmp.2005.01.002     Document Type: Article

References (41)

1. J.R. Anderson The adaptive character of thought 1990 Lawrence Erlbaum Publishers Hillsdale, NJ
2. S. Barberá & P.K. Pattanaik Falmagne and the rationalizability of stochastic choices in terms of random orderings Econometrica 54 3 1986 707-715
3. A. Brandstädt V.B. Le & J.P. Spinrad Graph classes: A survey 1999 SIAM Philadelphia
4. R.G. Downey & M.R. Fellows Parameterized complexity 1999 Springer New York
5. R.G. Downey M.R. Fellows & U. Stege Parameterized complexity: A framework for systematically confronting computational intractability In: F. Roberts J. Kratochvil J. Nesetril (Eds.) Contemporary trends in discrete mathematics: From DIMACS and DIMATIA to the future. DIMACS series in discrete mathematics and theoretical computer science vol. 49 1999 49-99
6. R.G. Downey M.R. Fellows & U. Stege Computational tractability: The view from Mars Bulletin of the European Association for Theoretical Computer Science 69 1999 73-97
7. W. Edwards The theory of decision making Psychological Bulletin 51 4 1954 380-417
8. J.-C.I. Falmagne & M. Regenwetter A random utility model for approval voting Journal of Mathematical Psychology 40 1996 152-159
9. P.H. Farquhar & V.R. Rao A balance model for evaluating subsets of multiattributed items Management Science 22 5 1976 528-539
10. M.R. Fellows Parameterized complexity: The main ideas and some research frontiers In: P. Eades T. Takaoka (Eds.) 12th International symposium on algorithms and computation. Lecture notes in computer science vol. 2223 2001 Springer Berlin 291-307
11. M.R. Fellows Parameterized complexity: The main ideas and connections to practical computing In: R. Fleischer B. Moret E. Meineche Schmidt (Eds.) Experimental algorithmics: From algorithm design to robust and efficient software. Lecture notes in computer science vol. 2547 2002 Springer Berlin 51-77
12. M.R. Fellows C. McCartin F. Rosamond & U. Stege Coordinatized kernels and catalytic reductions: An improved FPT algorithm for Max Leaf Spanning Tree and other problems In: S. Kapoor S. Prasad (Eds.) Foundations of software technology and theoretical computer science Lecture Notes in Computer Science vol. 1974 2000 Springer Berlin 240-251
13. P.C. Fishburn Interdependent preferences on finite sets Journal of Mathematical Psychology 9 1972 225-236
14. P.C. Fishburn Utility as an additive set function Mathematics of Operations Research 17 1992 910-920
15. P.C. Fishburn & I.H. LaValle Subset preferences in linear and nonlinear utility theory Journal of Mathematical Psychology 37 1993 611-623
16. P.C. Fishburn & I.H. LaValle Binary interactions and subset choice European Journal of Operational Research 92 1996 182-192
17. M. Frixione Tractable competence Minds and Machines 11 2001 379-397
18. M.R. Garey & D.S. Johnson Computers and intractability: A guide to the theory of NP-completeness 1979 Freeman New York
19. C.D. Green Cognitivism: Whose party is it anyway? Canadian Psychology 35 1994 112-123
20. J. Gross & J. Yellen Graph theory and its applications 1999 CRC Press New York
21. P. Grünwald Model selection based on minimum description length Journal of Mathematical Psychology 44 2000 133-152
22. R.M. Karp On the complexity of combinatorial problems Networks 5 1975 45-68
23. A. Kukla Nonempirical issues in psychology American Psychologist 44 1989 785-794
24. I.P. Levin J. Schreiber M. Lauriola & G.J. Gaeth A tale of two pizzas: Building up from a basic product versus scaling down from a fully loaded product Marketing Letters 13 4 2002 335-344
25. L. Martignon & U. Hoffrage Fast, frugal, and fit: Simple heuristics for paired comparison Theory and Decision 52 2002 29-71
26. L. Martignon & M. Schmitt Simplicity and robustness of fast and frugal heuristics Minds and Machines 9 1999 565-593
27. Niedermeier, R. (2002). Invitation to fixed-parameter algorithms. Habilitationsschrift, University of Tübingen.
28. M. Oaksford & N. Chater Rationality in an uncertain world. Essays on cognitive science of human reasoning 1998 Psychology Press East Sussex, UK
29. C.H. Papadimitriou & K. Steiglitz Combinatorial optimization: Algorithms and complexity 1998 Dover Publications New York
30. I. Parberry Circuit complexity and neural networks 1994 MIT Press Cambridge, MA
31. I. Parberry Knowledge, understanding, and computational complexity In: D.S. Levine & W.R. Elsberry (Eds.) Optimality in biological and artificial networks? 1997 Lawrence Erlbaum Publishers Hillsdale NJ 125-144
32. M.A. Pitt & I.J. Myung When a good fit can be bad Trends in Cognitive Sciences 6 2002 421-425
33. M. Regenwetter A.A.J. Marley & H. Joe Random utility threshold models of subset choice Australian Journal of Psychology 50 3 1998 175-185
34. D.N. Robinson Rationalism versus empiricism in cognition In: R.J. Sternberg (Eds.) The nature of cognition 1999 MIT Press Cambridge, MA 79-110
35. p) algorithm for p-Profit Cover and its practical implications for Vertex Cover In: P. Bose P. Morin (Eds.) 13th International symposium on algorithms and computation. Lecture notes in computer science vol. 2518 2002 Springer Berlin 249-261
36. P. Thagard Coherence in thought and action 2000 MIT Press Cambridge, MA
37. P. Thagard & K. Verbeurgt Coherence as constraint satisfaction Cognitive Science 22 1 1998 1-24
38. J.K. Tsotsos Analyzing vision at the complexity level Behavioral and Brain Sciences 13 3 1990 423-469
39. J.K. Tsotsos Is complexity theory appropriate for analyzing biological systems Behavioral and Brain Sciences 14 4 1991 770-773
40. van Rooij, I. (2003). Tractable cognition: Complexity theory in cognitive psychology. Ph.D. thesis, University of Victoria, Canada.
41. Wareham, H. T. (1998). Systematic parameterized complexity analysis in computational phonology. Ph.D. thesis, University of Victoria, Canada.