{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:12:26Z","timestamp":1742983946837,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662665961"},{"type":"electronic","value":"9783662665978"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-662-66597-8_2","type":"book-chapter","created":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T16:53:40Z","timestamp":1674147220000},"page":"21-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constructing Varied and\u00a0Attractive Shortlists from\u00a0Databases: A Group Decision Approach"],"prefix":"10.1007","author":[{"given":"David M.","family":"Ramsey","sequence":"first","affiliation":[]},{"given":"Aleksander","family":"Maria\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,20]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.disopt.2006.10.004","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T., Berthold, T.: Improving the feasibility pump. Discret. Optim. 4(1), 77\u201386 (2007)","journal-title":"Discret. Optim."},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ins.2021.04.034","volume":"570","author":"JA Aledo","year":"2021","unstructured":"Aledo, J.A., G\u00e1mez, J.A., Rosete, A.: A highly scalable algorithm for weak rankings aggregation. Inf. Sci. 570, 144\u2013171 (2021)","journal-title":"Inf. Sci."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S1930297500006781","volume":"95","author":"PP Analytis","year":"2014","unstructured":"Analytis, P.P., Kothiyal, A., Katsikopoulos, K.: Multi-attribute utility models as cognitive search engines. Judgm. Decis. Mak. 95, 403\u2013419 (2014)","journal-title":"Judgm. Decis. Mak."},{"issue":"7","key":"2_CR4","doi-asserted-by":"publisher","DOI":"10.1111\/cogs.12743","volume":"43","author":"PP Analytis","year":"2019","unstructured":"Analytis, P.P., Wu, C.M., Gelastopoulos, A.: Make-or-break: chasing risky goals or settling for safe rewards? Cogn. Sci. 43(7), e12743 (2019)","journal-title":"Cogn. Sci."},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.disopt.2006.10.001","volume":"4","author":"L Bertacco","year":"2007","unstructured":"Bertacco, L., Fischetti, M., Lodi, A.: A feasibility pump heuristic for general mixed-integer problems. Discret. Optim. 4(1), 63\u201376 (2007)","journal-title":"Discret. Optim."},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1002\/smj.3225","volume":"42","author":"S Billinger","year":"2021","unstructured":"Billinger, S., Srikanth, K., Stieglitz, N., Schumacher, T.R.: Exploration and exploitation in complex search tasks: how feedback influences whether and where human agents search. Strateg. Manag. J. 42(2), 361\u2013385 (2021)","journal-title":"Strateg. Manag. J."},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s11081-018-09419-w","volume":"20","author":"L Blackburn","year":"2019","unstructured":"Blackburn, L., Young, A., Rogers, P., Hedengren, J., Powell, K.: Dynamic optimization of a district energy system with storage using a novel mixed-integer quadratic programming algorithm. Optim. Eng. 20(2), 575\u2013603 (2019)","journal-title":"Optim. Eng."},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1037\/xlm0000419","volume":"44","author":"S Bobadilla-Suarez","year":"2018","unstructured":"Bobadilla-Suarez, S., Love, B.C.: Fast or frugal, but not both: decision heuristics under time pressure. J. Exp. Psychol. Learn. Mem. Cogn. 44(1), 24 (2018)","journal-title":"J. Exp. Psychol. Learn. Mem. Cogn."},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0165-4896(97)00033-4","volume":"35","author":"HH Bock","year":"1998","unstructured":"Bock, H.H., Day, W.H., McMorris, F.R.: Consensus rules for committee elections. Math. Soc. Sci. 35(3), 219\u2013232 (1998)","journal-title":"Math. Soc. Sci."},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1509\/jmkr.37.4.508.18794","volume":"37","author":"PA Bottomley","year":"2000","unstructured":"Bottomley, P.A., Doyle, J.R., Green, R.H.: Testing the reliability of weight elicitation methods: direct rating versus point allocation. J. Mark. Res. 37(4), 508\u2013513 (2000)","journal-title":"J. Mark. Res."},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1093\/restud\/rdy037","volume":"86","author":"A Caplin","year":"2019","unstructured":"Caplin, A., Dean, M., Leahy, J.: Rational inattention, optimal consideration sets, and stochastic choice. Rev. Econ. Stud. 86(3), 1061\u20131094 (2019)","journal-title":"Rev. Econ. Stud."},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ejor.2005.03.048","volume":"172","author":"WD Cook","year":"2006","unstructured":"Cook, W.D.: Distance-based and ad hoc consensus models in ordinal preference ranking. Eur. J. Oper. Res. 172(2), 369\u2013385 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10479-019-03290-3","volume":"298","author":"I Dahmani","year":"2021","unstructured":"Dahmani, I., Hifi, M.: A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs. Ann. Oper. Res. 298(1), 125\u2013147 (2021)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s00180-018-0858-z","volume":"34","author":"A D\u2019Ambrosio","year":"2019","unstructured":"D\u2019Ambrosio, A., Iorio, C., Staiano, M., Siciliano, R.: Median constrained bucket order rank aggregation. Comput. Stat. 34(2), 787\u2013802 (2019)","journal-title":"Comput. Stat."},{"issue":"5","key":"2_CR15","doi-asserted-by":"publisher","first-page":"699","DOI":"10.3917\/redp.305.0021","volume":"130","author":"M Diss","year":"2020","unstructured":"Diss, M., Kamwa, E., Tlidi, A.: On some $k$-scoring rules for committee elections: agreement and Condorcet Principle. Revue d\u2019economie politique 130(5), 699\u2013725 (2020)","journal-title":"Revue d\u2019economie politique"},{"issue":"3","key":"2_CR16","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s00355-017-1026-z","volume":"48","author":"E Elkind","year":"2017","unstructured":"Elkind, E., Faliszewski, P., Skowron, P., Slinko, A.: Properties of multiwinner voting rules. Soc. Choice Welfare 48(3), 599\u2013632 (2017)","journal-title":"Soc. Choice Welfare"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104(1), 91\u2013104 (2005)","journal-title":"Math. Program."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Zamora, D., Labella, \u00c1., Rodr\u00edguez, R.M., Mart\u00ednez, L.: Nonlinear preferences in group decision-making. Extreme values amplifications and extreme values reductions. Int. J. Intell. Syst. 36(11), 6581\u20136612 (2021)","DOI":"10.1002\/int.22561"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A Gibbard","year":"1973","unstructured":"Gibbard, A.: Manipulation of voting schemes. A general result. Econometrica 41, 587\u2013601 (1973)","journal-title":"Econometrica"},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10732-019-09433-w","volume":"27","author":"M Guignard","year":"2021","unstructured":"Guignard, M., Ahlatcioglu, A.: The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0\u20131 problems. J. Heuristics 27(1), 251\u2013265 (2021)","journal-title":"J. Heuristics"},{"key":"2_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijhm.2019.102379","volume":"87","author":"BD Guillet","year":"2020","unstructured":"Guillet, B.D., Mattila, A., Gao, L.: The effects of choice set size and information filtering mechanisms on online hotel booking. Int. J. Hosp. Manag. 87, 102379 (2020)","journal-title":"Int. J. Hosp. Manag."},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.eswa.2016.01.042","volume":"54","author":"I Kaliszewski","year":"2016","unstructured":"Kaliszewski, I., Podkopaev, D.: Simple additive weighting? A metamodel for multiple criteria decision analysis methods. Expert Syst. Appl. 54, 155\u2013161 (2016)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"2_CR23","first-page":"223","volume":"10","author":"M Kimya","year":"2018","unstructured":"Kimya, M.: Choice, consideration sets, and attribute filters. Am. Econ. J.: Microecon. 10(4), 223\u2013247 (2018)","journal-title":"Am. Econ. J.: Microecon."},{"issue":"6","key":"2_CR24","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1007\/s10726-020-09694-y","volume":"29","author":"K Kontek","year":"2020","unstructured":"Kontek, K., Sosnowska, H.: Specific tastes or cliques of jurors? How to reduce the level of manipulation in group decisions? Group Decis. Negot. 29(6), 1057\u20131084 (2020)","journal-title":"Group Decis. Negot."},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jet.2017.04.004","volume":"170","author":"JS Lleras","year":"2017","unstructured":"Lleras, J.S., Masatlioglu, Y., Nakajima, D., Ozbay, E.Y.: When more is less: limited consideration. J. Econ. Theory 170, 70\u201385 (2017)","journal-title":"J. Econ. Theory"},{"issue":"1","key":"2_CR26","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.jet.2011.11.012","volume":"147","author":"M Mandler","year":"2012","unstructured":"Mandler, M., Manzini, P., Mariotti, M.: A million answers to twenty questions: choosing by checklist. J. Econ. Theory 147(1), 71\u201392 (2012)","journal-title":"J. Econ. Theory"},{"key":"2_CR27","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Hoboken (1990)"},{"issue":"5","key":"2_CR28","doi-asserted-by":"publisher","first-page":"2183","DOI":"10.1257\/aer.102.5.2183","volume":"102","author":"Y Masatlioglu","year":"2012","unstructured":"Masatlioglu, Y., Nakajima, D., Ozbay, E.Y.: Revealed attention. Am. Econ. Rev. 102(5), 2183\u20132205 (2012)","journal-title":"Am. Econ. Rev."},{"key":"2_CR29","volume-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"KG Murty","year":"1988","unstructured":"Murty, K.G., Yu, F.T.: Linear Complementarity, Linear and Nonlinear Programming, vol. 3. Heldermann, Berlin (1988)"},{"key":"2_CR30","unstructured":"Otodom.pl. www.otodom.pl\/. Accessed 18 Aug 2021"},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"75","DOI":"10.22367\/mcdm.2019.14.05","volume":"14","author":"DM Ramsey","year":"2019","unstructured":"Ramsey, D.M.: Optimal Selection from a set of offers using a short list. Multiple Criteria Decis. Making 14, 75\u201392 (2019)","journal-title":"Multiple Criteria Decis. Making"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Ramsey, D.M., Maria\u0144ski, A., Szczurowski, L., K\u0229dziora, M.: On creating shortlists from a large database of offers. Acta Academica Karviniensia (2022, to appear)","DOI":"10.25142\/aak.2022.009"},{"key":"2_CR33","unstructured":"Ramsey, D.M., Maria\u0144ski, A.: An Algorithm for Creating Shortlists of Differentiated and Attractive Offers from Large Databases. Submitted to Computers and Operations Research (2022)"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Riabacke, M., Danielson, M., Ekenberg, L.: State-of-the-art prescriptive criteria weight elicitation. Advances in Decision Sciences (2012)","DOI":"10.1155\/2012\/276584"},{"issue":"1","key":"2_CR35","first-page":"3","volume":"1","author":"A Rubinstein","year":"2006","unstructured":"Rubinstein, A., Salant, Y.: A model of choice from lists. Theor. Econ. 1(1), 3\u201317 (2006)","journal-title":"Theor. Econ."},{"issue":"1","key":"2_CR36","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0377-2217(90)90057-I","volume":"48","author":"TL Saaty","year":"1990","unstructured":"Saaty, T.L.: How to make a decision: the analytic hierarchy process. Eur. J. Oper. Res. 48(1), 9\u201326 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2_CR37","doi-asserted-by":"publisher","first-page":"99","DOI":"10.2307\/1884852","volume":"69","author":"HA Simon","year":"1955","unstructured":"Simon, H.A.: A behavioral model of rational choice. Q. J. Econ. 69(1), 99\u2013118 (1955)","journal-title":"Q. J. Econ."},{"issue":"2","key":"2_CR38","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1037\/h0042769","volume":"63","author":"HA Simon","year":"1956","unstructured":"Simon, H.A.: Rational choice and the structure of the environment. Psychol. Rev. 63(2), 129 (1956)","journal-title":"Psychol. Rev."},{"issue":"10","key":"2_CR39","doi-asserted-by":"publisher","first-page":"1878","DOI":"10.1037\/xge0000749","volume":"149","author":"H Stoji\u0107","year":"2020","unstructured":"Stoji\u0107, H., Schulz, E., Analytis, P., Speekenbrink, M.: It\u2019s new, but is it good? How generalization and uncertainty guide the exploration of novel options. J. Exp. Psychol.: Gen. 149(10), 1878 (2020)","journal-title":"J. Exp. Psychol.: Gen."},{"issue":"1","key":"2_CR40","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1080\/00207179.2017.1316016","volume":"93","author":"R Takapoui","year":"2020","unstructured":"Takapoui, R., Moehle, N., Boyd, S., Bemporad, A.: A simple effective heuristic for embedded mixed-integer quadratic programming. Int. J. Control 93(1), 2\u201312 (2020)","journal-title":"Int. J. Control"},{"key":"2_CR41","volume-title":"Operations Research: An Introduction","author":"HA Taha","year":"2017","unstructured":"Taha, H.A.: Operations Research: An Introduction. Pearson Education Limited, London (2017)"},{"key":"2_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77645-3","volume-title":"Mathematics and Politics: Strategy, Voting, Power, and Proof","author":"AD Taylor","year":"2008","unstructured":"Taylor, A.D., Pacelli, A.M.: Mathematics and Politics: Strategy, Voting, Power, and Proof. Springer, Berlin (2008)"},{"issue":"5","key":"2_CR43","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1017\/S0140525X00003447","volume":"23","author":"PM Todd","year":"2000","unstructured":"Todd, P.M., Gigerenzer, G.: Pr\u00e9cis of simple heuristics that make us smart. Behav. Brain Sci. 23(5), 727\u2013741 (2000)","journal-title":"Behav. Brain Sci."},{"issue":"4","key":"2_CR44","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1287\/mksc.2017.1072","volume":"37","author":"RM Ursu","year":"2018","unstructured":"Ursu, R.M.: The power of rankings: quantifying the effect of rankings on online consumer search and purchase decisions. Mark. Sci. 37(4), 530\u2013552 (2018)","journal-title":"Mark. Sci."},{"key":"2_CR45","unstructured":"Yoon, K.P., Hwang, C.L.: Multiple Attribute Decision Making: An Introduction. (Series: Quantitative Applications in the Social Sciences, vol. 104). Sage Publications, Thousand Oaks (1995)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Collective Intelligence XXXVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-66597-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T17:09:19Z","timestamp":1674148159000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-66597-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783662665961","9783662665978"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-66597-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}