Martin Lackner
Projektass.(FWF) Dipl.-Ing. Dr.techn.
Role
-
PostDoc Researcher
Databases and Artificial Intelligence, E192-02
Courses
2022W
- Formal Methods in Computer Science / 185.A93 / UE
2023S
- Bachelor Thesis / 184.691 / PR
- Preferences in Artificial Intelligence / 184.768 / VU
- Project in Computer Science 1 / 184.688 / PR
- Project in Computer Science 2 / 184.689 / PR
Projects
-
Algorithms for Sustainable Group Decision Making
2019 – 2023 / Austrian Science Fund (FWF) / Publications: 147934, 148835, 148841, 148851, 149830, 61660, 61662, 61702, 61941, 62084, 62354, 62355 -
Fixed-Parameter Tractability in Artificial Intelligence and Reasoning (FAIR)
2013 – 2018 / Austrian Science Fund (FWF) / Publications: 152867, 153726, 155406, 155556, 156980, 157151, 157287, 159436, 160846, 161358, 161359, 163478, 58402, 58470, 58473, 58474, 58475, 58476, 58478, 58479, 58546, 58730, 58731, 58861, 59021, 59164, 59165, 59526, 59550, 59551, 59552, 59573, 59574, 59708, 59710, 59743, 59748, 59756, 59773, 59881, 59887, 59967, 59971, 59999, 60000, 60001, 60016, 60449, 60454, 60824, 60830, 60846, 60847, 60848, 60867, 60868, 61284, 61316, 61323, 61332, 61335, 61336, 61337, 61338, 61361, 61369, 90418, 90440, 90712, 90719 -
Heterogenous Information Integration
2012 – 2017 / Austrian Science Fund (FWF) / Publications: 150854, 157071, 159435, 160883, 57091, 58482, 58483, 58485, 58534, 59175, 59176, 59177, 59570, 59681, 59683, 59756, 59864, 59878, 59879, 59880, 59882, 59885, 59887, 59889, 60277, 60328, 60329, 60331, 60334, 60335, 60336, 60338, 60339, 60449, 60456, 60459, 60460, 60461, 60463, 60464, 60466, 60824, 60842, 60846, 60847, 60848, 60867, 60868, 61369, 62621, 62622, 62623, 62624, 62625, 62626, 90722, 90829 -
SEE: SPARQL Evaluation and Extensions
2012 – 2016 / Vienna Science and Technology Fund (WWTF) / Publications: 160846, 160883, 163693, 163857, 58571, 58647, 58730, 58731, 58791, 58861, 59083, 59147, 59164, 59165, 59177, 59562, 59563, 59564, 59566, 59675, 59676, 59677, 59681, 59683, 59708, 59710, 59743, 59748, 59773, 59864, 59878, 59879, 59880, 59881, 59882, 59885, 59887, 59890, 60189, 60277, 60328, 60329, 60331, 60334, 60335, 60336, 60338, 60339, 60449, 62617, 62621, 62622, 62623, 62624, 62625, 62626, 90722, 90829 -
Theoretical Tractability vs. Practical Computation
2008 – 2012 / Austrian Science Fund (FWF) / Publications: 163468, 163619, 163857, 171669, 171670, 175369, 40665, 56407, 56408, 56422, 56424, 56425, 56427, 56428, 56801, 56837, 57341, 57345, 57833, 57859, 57860, 57862, 57883, 58571
Publications
Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.
2023
- Multi-Winner Voting with Approval Preferences / Lackner, M., & Skowron, P. (2023). Multi-Winner Voting with Approval Preferences. Springer. https://doi.org/10.1007/978-3-031-09016-5 / Project: SuDeMa
2022
- Liquid Democracy with Ranked Delegations / Brill, M., Delemazure, T., George, A.-M., Lackner, M., & Schmidt-Kraepelin, U. (2022). Liquid Democracy with Ranked Delegations. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (pp. 4884–4891). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20417 / Project: SuDeMa
- Participatory Budgeting with Donations and Diversity Constraints / Chen, J., Lackner, M., & Maly, J. (2022). Participatory Budgeting with Donations and Diversity Constraints. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 9323–9330). AAAI Press. https://doi.org/10.1609/aaai.v36i9.21163 / Project: SuDeMa
- How to Sample Approval Elections? / Szufa, S., Faliszewski, P., Janeczko, L., Lackner, M., Slinko, A., Sornat, K., & Talmon, N. (2022). How to Sample Approval Elections? In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22) (pp. 496–502). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2022/71 / Project: SuDeMa
2021
- Consistent approval-based multi-winner rules / Lackner, M., & Skowron, P. (2021). Consistent approval-based multi-winner rules. Journal of Economic Theory, 192(105173), 105173. https://doi.org/10.1016/j.jet.2020.105173
- Computing Kemeny Rankings from d-Euclidean Preferences / Hamm, T., Lackner, M., & Rapberger, A. (2021). Computing Kemeny Rankings from d-Euclidean Preferences. In Algorithmic Decision Theory (pp. 147–161). https://doi.org/10.1007/978-3-030-87756-9_10
- Fairness in Long-Term Participatory Budgeting / Lackner, M., Maly, J., & Rey, S. (2021). Fairness in Long-Term Participatory Budgeting. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. AAMAS 2021 - 20th International Conference on Autonomous Agents and Multiagent Systems, London, UK, International. https://doi.org/10.24963/ijcai.2021/42 / Project: SuDeMa
- Fairness in Long-Term Participatory Budgeting / Lackner, M., Maly, J., & Rey, S. (2021). Fairness in Long-Term Participatory Budgeting. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, International. https://doi.org/10.24963/ijcai.2021/42 / Project: SuDeMa
- Approval-Based Shortlisting / Lackner, M., & Maly, J. (2021). Approval-Based Shortlisting. In AAMAS ’21: 20th International Conference on Autonomous Agents and Multiagent Systems, Virtual Event, United Kingdom, May 3-7, 2021 (pp. 737–745). http://hdl.handle.net/20.500.12708/58557
2020
- A Mathematical Analysis of an Election System Proposed by Gottlob Frege / Harrenstein, P., Lackner, M.-L., & Lackner, M. (2020). A Mathematical Analysis of an Election System Proposed by Gottlob Frege. Erkenntnis, 87(6), 2609–2644. https://doi.org/10.1007/s10670-020-00318-0
- Preferences Single-Peaked on a Circle / Lackner, M., & Peters, D. (2020). Preferences Single-Peaked on a Circle. Artificial Intelligence, 68, 463–502. https://doi.org/10.1613/jair.1.11732
- Utilitarian welfare and representation guarantees of approval-based multiwinner rules / Lackner, M., & Skowron, P. (2020). Utilitarian welfare and representation guarantees of approval-based multiwinner rules. Artificial Intelligence, 288(103366), 103366. https://doi.org/10.1016/j.artint.2020.103366
- Incomplete Preferences in Single-Peaked Electorates / Lackner, M., & Fitzsimmons, Z. (2020). Incomplete Preferences in Single-Peaked Electorates. Artificial Intelligence, 67, 797–833. https://doi.org/10.1613/jair.1.11577
- Perpetual Voting: Fairness in Long-Term Decision Making / Lackner, M. (2020). Perpetual Voting: Fairness in Long-Term Decision Making. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2103–2110). https://doi.org/10.1609/aaai.v34i02.5584
- Proportional Belief Merging / Haret, A., Lackner, M., Pfandler, A., & Wallner, J. P. (2020). Proportional Belief Merging. In V. Conitzer & F. Sha (Eds.), Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2822–2829). AAAI Press. https://doi.org/10.1609/aaai.v34i03.5671 / Projects: HyperTrac, SuDeMa
2019
- Aggregating Expert Opinions in Support of Medical Diagnostic Decision-Making / Gangl, C., Lackner, M., Maly, J., & Woltran, S. (2019). Aggregating Expert Opinions in Support of Medical Diagnostic Decision-Making. In Knowledge Representation for Health Care/ProHealth, KR4HC 2019 (pp. 56–62). http://hdl.handle.net/20.500.12708/57907 / Projects: START, SuDeMa
- A Quantitative Analysis of Multi-Winner Rules / Lackner, M., & Skowron, P. (2019). A Quantitative Analysis of Multi-Winner Rules. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, {IJCAI} 2019, Macao, China, August 10-16, 2019. IJCAI 2019 - 28th International Joint Conference on Artificial Intelligence, Macao, China, Non-EU. ijcai.org. https://doi.org/10.24963/ijcai.2019 / Project: SuDeMa
- On Rational Delegations in Liquid Democracy / Bloembergen, D., Grossi, D., & Lackner, M. (2019). On Rational Delegations in Liquid Democracy. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 1796–1803). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33011796 / Project: SuDeMa
2018
- Consistent Approval-Based Multi-Winner Rules / Lackner, M., & Skowron, P. (2018). Consistent Approval-Based Multi-Winner Rules. In Proceedings of the 2018 ACM Conference on Economics and Computation. ACM Conference on Economics and Computation, Ithaca, New York, USA, Non-EU. https://doi.org/10.1145/3219166.3219170 / Projects: FAIR, START
- On the Complexity of Extended and Proportional Justified Representation / Lackner, M., Aziz, H., Elkind, E., Huang, S., Sánchez-Fernández, L., & Skowron, P. (2018). On the Complexity of Extended and Proportional Justified Representation. In Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th {AAAI} Symposium on Educational Advances in Artificial Intelligence (EAAI-18) (pp. 902–909). AAAI Press. http://hdl.handle.net/20.500.12708/57543 / Projects: FAIR, START
- Effective Heuristics for Committee Scoring Rules / Lackner, M., Faliszewski, P., Peters, D., & Talmon, N. (2018). Effective Heuristics for Committee Scoring Rules. In Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th {AAAI} Symposium on Educational Advances in Artificial Intelligence (EAAI-18) (pp. 1023–1030). AAAI Press. http://hdl.handle.net/20.500.12708/57542 / Projects: FAIR, START
- Multiwinner Elections With Diversity Constraints / Lackner, M., Bredereck, R., Faliszewski, P., Igarashi, A., & Skowron, P. (2018). Multiwinner Elections With Diversity Constraints. In Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th {AAAI} Symposium on Educational Advances in Artificial Intelligence (EAAI-18) (pp. 933–940). AAAI Press. http://hdl.handle.net/20.500.12708/57541 / Projects: FAIR, START
- Approval-Based Multi-Winner Rules and Strategic Voting / Lackner, M., & Skowron, P. (2018). Approval-Based Multi-Winner Rules and Strategic Voting. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, EU. ijcai.org. https://doi.org/10.24963/ijcai.2018/47 / Projects: FAIR, START
- Computing the Schulze Method for Large-Scale Preference Data Sets / Csar, T., Lackner, M., & Pichler, R. (2018). Computing the Schulze Method for Large-Scale Preference Data Sets. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, EU. ijcai.org. https://doi.org/10.24963/ijcai.2018/25 / Projects: FAIR, HyperTrac, START
- A Quantitative Analysis of Multi-Winner Rules / Lackner, M., & Skowron, P. (2018). A Quantitative Analysis of Multi-Winner Rules. In Proceedings of the 7th International Workshop on Computational Social Choice (COMSOC 2018) (pp. 1–29). Computing Research Repository (CoRR). http://hdl.handle.net/20.500.12708/57490 / Projects: FAIR, START
2017
- Computational Social Choice in the Clouds / Csar, T., Lackner, M., Pichler, R., & Sallinger, E. (2017). Computational Social Choice in the Clouds. In Workshop Präferenzen und Personalisierung in der Informatik bei der Konferenz “Datenbanksysteme für Business, Technologie und Web” (BTW) (pp. 163–167). http://hdl.handle.net/20.500.12708/57077 / Projects: FAIR, HINT, START
- Winner Determination in Huge Elections with MapReduce. AAAI 2017: 451-458 / Csar, T., Lackner, M., Pichler, R., & Sallinger, E. (2017). Winner Determination in Huge Elections with MapReduce. AAAI 2017: 451-458. In AAAI 2017 (pp. 451–458). http://hdl.handle.net/20.500.12708/57076 / Projects: FAIR, HINT, START
2016
- Winner Determination in Huge Elections with MapReduce / Csar, T., Lackner, M., Pichler, R., & Sallinger, E. (2016). Winner Determination in Huge Elections with MapReduce. In M. Endres, N. Mattei, & A. Pfandler (Eds.), 10th Multidisciplinary Workshop on Advances in Preference Handling (p. 7). http://hdl.handle.net/20.500.12708/56661 / Projects: FAIR, HINT, SEE, START
2015
- Structure in Dichotomous Preferences / Elkind, E., & Lackner, M. (2015). Structure in Dichotomous Preferences. In Q. Yang & M. Wooldridge (Eds.), Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015 (pp. 2019–2025). AAAI Press. http://hdl.handle.net/20.500.12708/56255 / Project: START
- Manipulation of k-Approval in Nearly Single-Peaked Electorates / Erdélyi, G., Lackner, M., & Pfandler, A. (2015). Manipulation of k-Approval in Nearly Single-Peaked Electorates. In T. Walsh (Ed.), Algorithmic Decision Theory (pp. 71–85). Springer. https://doi.org/10.1007/978-3-319-23114-3_5 / Projects: FAIR, START
- The Complexity of Recognizing Incomplete Single-Crossing Preferences / Elkind, E., Faliszewski, P., Lackner, M., & Obraztsova, S. (2015). The Complexity of Recognizing Incomplete Single-Crossing Preferences. In B. Bonet & S. Koenig (Eds.), Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA (pp. 865–871). AAAI Press. http://hdl.handle.net/20.500.12708/56103 / Project: SEE
2014
- On Detecting Nearly Structured Preference Profiles / Lackner, M., & Elkind, E. (2014). On Detecting Nearly Structured Preference Profiles. Workshop on Challenges in Algorithmic Social Choice (CASC), Bad Belzig, Deutschland, EU. http://hdl.handle.net/20.500.12708/85941
- The Likelihood of Structure in Preference Profiles / Bruner, M.-L., & Lackner, M. (2014). The Likelihood of Structure in Preference Profiles. 8th Multidisciplinary Workshop on Advances in Preference Handling, Quebec, Kanada, Non-EU. http://hdl.handle.net/20.500.12708/85942
- On the Parameterized Complexity of Generalized CP-Nets / Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2014). On the Parameterized Complexity of Generalized CP-Nets. Workshop on Challenges in Algorithmic Social Choice (CASC), Bad Belzig, Deutschland, EU. http://hdl.handle.net/20.500.12708/85939 / Project: FAIR
- Detecting structure in permutations and preferences / Lackner, M. (2014). Detecting structure in permutations and preferences [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.24943
- A Parameterized Complexity Analysis of Generalized CP-Nets / Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2014). A Parameterized Complexity Analysis of Generalized CP-Nets. In M. R. Fellows, S. Gaspers, & T. Walsh (Eds.), Proceedings of the 2nd Workshop on the Parameterized Complexity of Computational Reasoning (PCCR) (p. 2). http://hdl.handle.net/20.500.12708/55773 / Project: FAIR
- On Detecting Nearly Structured Preference Profiles / Elkind, E., & Lackner, M. (2014). On Detecting Nearly Structured Preference Profiles. In C. E. Brodley & P. Stone (Eds.), Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence (pp. 661–667). http://hdl.handle.net/20.500.12708/55796
- A Parameterized Complexity Analysis of Generalized CP-Nets / Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2014). A Parameterized Complexity Analysis of Generalized CP-Nets. In C. E. Brodley & P. Stone (Eds.), Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence (pp. 1091–1097). http://hdl.handle.net/20.500.12708/55793 / Project: FAIR
- Incomplete Preferences in Single-Peaked Electorates / Lackner, M. (2014). Incomplete Preferences in Single-Peaked Electorates. In C. E. Brodley & P. Stone (Eds.), Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence (pp. 742–748). http://hdl.handle.net/20.500.12708/55786
2013
- The computational landscape of permutation patterns / Bruner, M.-L., & Lackner, M. (2013). The computational landscape of permutation patterns. arXiv. https://doi.org/10.48550/arXiv.1301.0340 / Project: FAIR
- The computational landscape of permutation patterns / Bruner, M.-L., & Lackner, M. (2013). The computational landscape of permutation patterns. 11th Permutation Patterns Conference, Paris, EU. http://hdl.handle.net/20.500.12708/120423
- Single-peaked preference profiles and permutation patterns: A unified perspective / Lackner, M. (2013). Single-peaked preference profiles and permutation patterns: A unified perspective. 11th Permutation Patterns Conference, Paris, EU. http://hdl.handle.net/20.500.12708/85645 / Project: FAIR
- Computational Aspects of Nearly Single-Peaked Electorates / Erdélyi, G., Lackner, M., & Pfandler, A. (2013). Computational Aspects of Nearly Single-Peaked Electorates. In Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI-13) (pp. 283–289). AAAI Press. http://hdl.handle.net/20.500.12708/54792 / Project: FAIR
- A Parameterized Complexity Analysis of Generalized CP-Nets / Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2013). A Parameterized Complexity Analysis of Generalized CP-Nets. In 7th Multidisciplinary Workshop on Advances in Preference Handling (p. 7). http://hdl.handle.net/20.500.12708/54788 / Project: FAIR
- Incomplete Preferences in Single-Peaked Electorates / Lackner, M. (2013). Incomplete Preferences in Single-Peaked Electorates. In 7th Multidisciplinary Workshop on Advances in Preference Handling (p. 7). http://hdl.handle.net/20.500.12708/54789 / Project: FAIR
2012
- Fixed-Parameter Algorithms for Finding Minimal Models / Lackner, M., & Pfandler, A. (2012). Fixed-Parameter Algorithms for Finding Minimal Models. Logic and interactions 2012, CIRM, Marseille, France, EU. http://hdl.handle.net/20.500.12708/85367
- Permutation Pattern Matching and its Parameterized Complexity / Lackner, M., & Bruner, M.-L. (2012). Permutation Pattern Matching and its Parameterized Complexity. Conference on Computability in Europe CiE, Cambridge, Great Britain, EU. http://hdl.handle.net/20.500.12708/85363
- A Fast Algorithm for Permutation Pattern Matching / Lackner, M. (2012). A Fast Algorithm for Permutation Pattern Matching. Universität Siegen, Siegen, Deutschland, EU. http://hdl.handle.net/20.500.12708/85375
- Fixed-Parameter Algorithms for Finding Minimal Models / Lackner, M., & Pfandler, A. (2012). Fixed-Parameter Algorithms for Finding Minimal Models. Universität Siegen, Siegen, Deutschland, EU. http://hdl.handle.net/20.500.12708/85373
- Fixed-Parameter Algorithms for Closed World Reasoning / Lackner, M., & Pfandler, A. (2012). Fixed-Parameter Algorithms for Closed World Reasoning. In L. D. Raedt, C. Bessiere, D. Dubois, P. Doherty, P. Frasconi, F. Heintz, & P. Lucas (Eds.), Proceedings of the ECAI Conference (pp. 492–497). IOS Press. http://hdl.handle.net/20.500.12708/54183
- Multicut on Graphs of Bounded Clique-Width / Lackner, M., Pichler, R., Rümmele, S., & Woltran, S. (2012). Multicut on Graphs of Bounded Clique-Width. In G. Lin (Ed.), Combinatorial Optimization and Applications (pp. 115–126). Springer. https://doi.org/10.1007/978-3-642-31770-5_11 / Project: TTPC
- A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs / Lackner, M., & Bruner, M.-L. (2012). A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs. In F. Fomin & P. Kaski (Eds.), Algorithm Theory – SWAT 2012 (pp. 261–270). Springer. https://doi.org/10.1007/978-3-642-31155-0_23
- Fixed-Parameter Algorithms for Finding Minimal Models / Lackner, M., & Pfandler, A. (2012). Fixed-Parameter Algorithms for Finding Minimal Models. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. on Principles of Knowledge Representation and Reasoning (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/54179 / Project: TTPC
- The Complexity of Nearly Single-Peaked Consistency / Erdély, G., Lackner, M., & Pfandler, A. (2012). The Complexity of Nearly Single-Peaked Consistency. In F. Brandt & P. Faliszewski (Eds.), Proceedings of fourth int. conference on Computational Social Choice (p. 12). http://hdl.handle.net/20.500.12708/54178 / Project: TTPC
2011
- On the fixed-parameter tractability of computing minimal models / Lackner, M. (2011). On the fixed-parameter tractability of computing minimal models. Workshop - Parameterized Complexity: Not About Graphs, Darwin, Australien, Non-EU. http://hdl.handle.net/20.500.12708/85368
- Hardness results for Weighted Minimal Model SAT / Pfandler, A., & Lackner, M. (2011). Hardness results for Weighted Minimal Model SAT. Workshop - Parameterized Complexity: Not About Graphs, Darwin, Australien, Non-EU. http://hdl.handle.net/20.500.12708/85217
- Algorithms for finding minimal models / Lackner, M., & Pfandler, A. (2011). Algorithms for finding minimal models. Workshop - Parameterized Complexity: Not About Graphs, Darwin, Australien, Non-EU. http://hdl.handle.net/20.500.12708/85216
2010
- Complexity results and algorithms for Multicut on graphs of bounded clique-width / Lackner, M. (2010). Complexity results and algorithms for Multicut on graphs of bounded clique-width [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-44603
Supervisions
Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.
- Ranking sets of objects : how to deal with impossibility results / Maly, J. (2020). Ranking sets of objects : how to deal with impossibility results [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.83187
- Algorithms for implicit delegation to predict preferences / Krenn, B. (2019). Algorithms for implicit delegation to predict preferences [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.69824