{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:51:19Z","timestamp":1742914279294,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031710322"},{"type":"electronic","value":"9783031710339"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-71033-9_26","type":"book-chapter","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:02:17Z","timestamp":1725321737000},"page":"461-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Matrix Rationalization via\u00a0Partial Orders"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-7716-8183","authenticated-orcid":false,"given":"Agnes","family":"Totschnig","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7130-0427","authenticated-orcid":false,"given":"Rohit","family":"Vasishta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2213-4937","authenticated-orcid":false,"given":"Adrian","family":"Vetta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,31]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.jcss.2019.04.005","volume":"105","author":"G Bachmeier","year":"2019","unstructured":"Bachmeier, G., et al.: $$k$$-majority digraphs and the hardness of voting with a constant number of voters. J. Comput. Syst. Sci. 105, 130\u2013157 (2019)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR2","unstructured":"Batchelder, W., Colonius, H., Dzhafarov, E., Myung, J.: New Handbook of Mathematical Psychology, vol. 1. Cambridge University Press, Foundations and Methodology (2016)"},{"key":"26_CR3","unstructured":"Block, H., Marschak, J.: Random orderings and stochastic theories of response. In: Olkin, I. (ed.) Contributions to Probability and Statistics. Stanford University Press (1960)"},{"issue":"2","key":"26_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.3934\/fods.2021010","volume":"3","author":"T Cameron","year":"2021","unstructured":"Cameron, T., Charmot, S., Pulaj, J.: On the linear ordering problem and the rankability of data. Found. Data Sci. 3(2), 133\u2013149 (2021)","journal-title":"Found. Data Sci."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1137\/060649987","volume":"37","author":"X Chen","year":"2007","unstructured":"Chen, X., Hu, X., Zang, W.: A min-max theorem on tournaments. SIAM J. Comput. 37, 923\u2013937 (2007)","journal-title":"SIAM J. Comput."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00199-005-0074-2","volume":"31","author":"I Dasgupta","year":"2007","unstructured":"Dasgupta, I., Pattanaik, P.: \u2018regular\u2019 choice and the weak aximom of stochastic revealed preference. Econ. Theor. 31, 35\u201350 (2007)","journal-title":"Econ. Theor."},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R Dilworth","year":"1950","unstructured":"Dilworth, R.: A decomposition theorem for partially ordered sets. Ann. Math. 51(1), 161\u2013166 (1950)","journal-title":"Ann. Math."},{"key":"26_CR8","first-page":"15","volume":"69","author":"T Dridi","year":"1980","unstructured":"Dridi, T.: Sur les distribution binaires associ\u00e9es \u00e0 des distribution ordinales. Math. Sci. Hum. 69, 15\u201331 (1980)","journal-title":"Math. Sci. Hum."},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/0022-2496(78)90048-2","volume":"18","author":"JC Falmagne","year":"1978","unstructured":"Falmagne, J.C.: A representation theorem for finite random scale systems. J. Math. Psychol. 18, 52\u201372 (1978)","journal-title":"J. Math. Psychol."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.jmp.2003.11.003","volume":"48","author":"S Fiorini","year":"2004","unstructured":"Fiorini, S.: A short proof of a theorem of Falmagne. J. Math. Psychol. 48, 80\u201382 (2004)","journal-title":"J. Math. Psychol."},{"issue":"3","key":"26_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(87)90060-6","volume":"16","author":"P Fishburn","year":"1987","unstructured":"Fishburn, P.: Decomposing weighted digraphs into sums of chains. Discret. Appl. Math. 16(3), 223\u2013238 (1987)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"26_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0165-4896(92)90038-7","volume":"23","author":"P Fishburn","year":"1992","unstructured":"Fishburn, P.: Induced binary probabilities and the linear ordering polytope: a status report. Math. Soc. Sci. 23(1), 67\u201380 (1992)","journal-title":"Math. Soc. Sci."},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.jctb.2018.10.001","volume":"136","author":"J Fox","year":"2017","unstructured":"Fox, J., Gishboliner, L., Shapira, A., Yuster, R.: The removal lemma for tournaments. J. Comb. Theory, Ser. B 136, 110\u2013134 (2017)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"26_CR14","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA (1979)"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02932410","volume":"25","author":"M Gr\u00f6tschel","year":"1983","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: Optimal triangulation of large real world input-output matrices. Stat Hefte 25, 261\u2013295 (1983)","journal-title":"Stat Hefte"},{"key":"26_CR16","first-page":"19","volume":"40","author":"G Guilbaud","year":"1953","unstructured":"Guilbaud, G.: Sur une difficult\u00e9 de la th\u00e9orie du risque. Colloques Internationaux Du CNRS, Econom\u00e9trie 40, 19\u201325 (1953)","journal-title":"Colloques Internationaux Du CNRS, Econom\u00e9trie"},{"key":"26_CR17","unstructured":"Klingelhoefer, F., Newman, A.: Coloring tournaments with few colors: algorithms and complexity. In: Proceedings of the 31st Annual European Symposium on Algorithms (ESA), pp. 71:1\u201371:14 (2023)"},{"key":"26_CR18","unstructured":"Marschak, J.: Binary-choice constraints and random utility indicators. In: Arrow, K., Karlin, S., Suppes, P. (eds.) Economic Information, Decision, and Prediction, pp. 312\u2013329. Stanford University Press (1960)"},{"key":"26_CR19","series-title":"Applied Mathematical Sciences","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16729-4","volume-title":"The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization","author":"R Mart\u00ed","year":"2011","unstructured":"Mart\u00ed, R., Reinelt, G.: The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization. Applied Mathematical Sciences, Springer, Berlin Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-16729-4"},{"issue":"4","key":"26_CR20","doi-asserted-by":"publisher","first-page":"608","DOI":"10.2307\/1907926","volume":"21","author":"D McGarvey","year":"1953","unstructured":"McGarvey, D.: A theorem on the construction of voting paradoxes. Econometrica 21(4), 608\u2013610 (1953)","journal-title":"Econometrica"},{"issue":"3","key":"26_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0095-8956(82)90046-6","volume":"33","author":"V Neumann-Lara","year":"1982","unstructured":"Neumann-Lara, V.: The dichromatic number of a digraph. J. Comb. Theory, Ser. B 33(3), 265\u2013270 (1982)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.jmp.2016.04.003","volume":"75","author":"R Suck","year":"2016","unstructured":"Suck, R.: Regular choice systems: a general technique to represent them by random variables. J. Math. Psychol. 75, 110\u2013117 (2016)","journal-title":"J. Math. Psychol."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71033-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:05:57Z","timestamp":1725321957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71033-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031710322","9783031710339"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71033-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"31 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cwi.nl\/en\/groups\/networks-and-optimization\/events\/sagt-2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}