{"type":"ScholarlyArticle","title":"Anytime Sorting Algorithms","authors":[{"name":"Emma Caizergues","slug":"emma-caizergues","given":"Emma","family":"Caizergues","affiliation":"Nokia Bell Labs , Massy , France; CNRS -Lamsade , Université Paris Dauphine -PSL , Paris , France"},{"name":"François Durand","slug":"francois-durand","given":"François","family":"Durand","affiliation":""},{"name":"Fabien Mathieu","slug":"fabien-mathieu","given":"Fabien","family":"Mathieu","affiliation":"Swapcard Lab , Paris , France"}],"abstract":"This paper addresses the anytime sorting problem, aiming to develop algorithms providing tentative estimates of the sorted list at each execution step. Comparisons are treated as steps, and the Spearman's footrule metric evaluates estimation accuracy. We propose a general approach for making any sorting algorithm anytime and introduce two new algorithms: multizip sort and Corsort. Simulations showcase the superior performance of both algorithms compared to existing methods. Multizip sort keeps a low global complexity, while Corsort produces intermediate estimates surpassing previous algorithms.","doi":"10.24963/ijcai.2024/785","url":"https://ijcai.org/proceedings/2024/785","pdf":"https://ijcai.org/proceedings/2024/0785.pdf","markdown":"https://ijcai.org/proceedings/2024/785.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/785","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Uncertainty in AI","track":"Main Track","number":785,"pages":{"first":7101,"last":7108},"keywords":["Uncertainty in AI: UAI: Uncertainty representations","Uncertainty in AI: UAI: Decision and utility theory"],"videos":[],"references":[{"position":1,"raw":"[Alewijnse et al., 2014] S. P. A. Alewijnse, T. M. Bagautdi- nov, M. de Berg, Q. W. Bouts, A. P. ten Brink, K. Buchin, and M. A. Westenberg. Progressive Geometric Algorithms. In Proceedings of the Thirtieth Annual Symposium on Com- putational Geometry, pages 50-59, 2014.","title":"Progressive Geometric Algorithms","authors":"S P A Alewijnse, T M Bagautdinov, M Berg, Q W Bouts, A P Brink, K Buchin, M A Westenberg","year":"2014","venue":"Proceedings of the Thirtieth Annual Symposium on Computational Geometry","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Brightwell and Winkler, 1991] Graham Brightwell and Pe- ter Winkler. Counting linear extensions is #P-complete. In Proceedings of the Twenty-Third ACM Symposium on Theory of Computing -STOC '91, pages 175-181, 1991.","title":"Counting linear extensions is #P-complete","authors":"Winkler Brightwell, Graham Brightwell, Peter Winkler","year":"1991","venue":"Proceedings of the Twenty-Third ACM Symposium on Theory of Computing -STOC '91","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Caizergues et al., 2023] Emma Caizergues, Franc ¸ois Du- rand, and Fabien Mathieu. Corsort: Comparaison ORiented Sort. https://emczg.github.io/corsort/, 2023.","title":"Emma Caizergues, Franc ¸ois Durand","authors":"Caizergues","year":"2023","venue":null,"doi":null,"url":"https://emczg.github.io/corsort/,2023","internal_url":null},{"position":4,"raw":"[Caizergues et al., 2024] Emma Caizergues, Franc ¸ois Du- rand, and Fabien Mathieu. Anytime sorting algorithms (extended version). AN URL HERE, 2024.","title":"Anytime sorting algorithms","authors":"Emma Caizergues, Fabien Franc ¸ois Durand, Mathieu","year":"2024","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Calauzènes and Usunier, 2020] Clément Calauzènes and Nicolas Usunier. On ranking via sorting by estimated ex- pected utility. In Advances in Neural Information Process- ing Systems -NeurIPS '20, volume 33, pages 3699-3710, 2020.","title":"Clément Calauzènes and Nicolas Usunier. On ranking via sorting by estimated expected utility","authors":"Usunier Calauzènes","year":"2020","venue":"Advances in Neural Information Processing Systems -NeurIPS '20","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Cardinal et al., 2010] Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, and J. Ian Munro. Sorting under partial information (without the ellipsoid algorithm). In Proceedings of the Forty-Second ACM Symposium on Theory of Computing -STOC '10, pages 359-368, 2010.","title":"Sorting under partial information (without the ellipsoid algorithm)","authors":"Jean Cardinal, Samuel Fiorini, Gwenaël Joret, M Raphaël, J Jungers, Ian Munro","year":"2010","venue":"Proceedings of the Forty-Second ACM Symposium on Theory of Computing -STOC '10","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Ciura, 2001] Marcin Ciura. Best increments for the average case of Shellsort. In Fundamentals of Computation Theory: Thirteenth International Symposium, pages 106-117, 2001.","title":"Best increments for the average case of Shellsort","authors":"Marcin Ciura","year":"2001","venue":"Fundamentals of Computation Theory: Thirteenth International Symposium","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Cormen et al., 2009] Thomas H. Cormen, Charles E. Leiser- son, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, 3rd Edition. MIT Press, 2009.","title":"Introduction to Algorithms","authors":"H Thomas, Charles E Cormen, Ronald L Leiserson, Clifford Rivest, Stein","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Diaconis and Graham, 1977] Persi Diaconis and Ronald L. Graham. Spearman's footrule as a measure of disarray. Journal of the Royal Statistical Society Series B: Statistical Methodology, 39(2):262-268, 1977.","title":"Spearman's footrule as a measure of disarray","authors":"Persi Diaconis, Ronald L Graham","year":"1977","venue":"Journal of the Royal Statistical Society Series B: Statistical Methodology","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Dushkin and Milo, 2018] Eyal Dushkin and Tova Milo. Top- k sorting under partial order information. In Proceedings of the 2018 International Conference on Management of Data, pages 1007-1019, 2018.","title":"Topk sorting under partial order information","authors":"Milo ; Dushkin, Eyal Dushkin, Tova Milo","year":"2018","venue":"Proceedings of the 2018 International Conference on Management of Data","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Ford and Johnson, 1959] Lester R. Ford and Selmer M. Johnson. A tournament problem. The American Math- ematical Monthly, 66(5):387-389, 1959.","title":"A tournament problem","authors":"Lester R Ford, Selmer M Johnson","year":"1959","venue":"The American Mathematical Monthly","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Giesen et al., 2009] Joachim Giesen, Eva Schuberth, and Miloš Stojaković. Approximate sorting. Fundamenta In- formaticae, 90(1-2):67-72, 2009.","title":"Approximate sorting","authors":"Joachim Giesen, Eva Schuberth, Miloš Stojaković","year":"2009","venue":"Fundamenta Informaticae","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Grass and Zilberstein, 1996] Joshua Grass and Shlomo Zil- berstein. Anytime algorithm development tools. SIGART Bulletin Special Issue on Anytime Algorithms and Deliber- ation Scheduling, 7(2):20-27, 1996.","title":"Joshua Grass and Shlomo Zilberstein. Anytime algorithm development tools","authors":"Zilberstein Grass","year":"1996","venue":"SIGART Bulletin Special Issue on Anytime Algorithms and Deliberation Scheduling","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hoare, 1961] Charles A. R. Hoare. Algorithm 65: find. Com- munications of the ACM, 4(7):321-322, 1961.","title":"Algorithm 65: find","authors":"A R Charles, Hoare","year":"1961","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Horvitz, 1988] Eric J. Horvitz. Reasoning under varying and uncertain resource constraints. In Proceedings of the Sev- enth AAAI National Conference on Artificial Intelligence - AAAI '88, page 111-116, 1988.","title":"Reasoning under varying and uncertain resource constraints","authors":"Eric J Horvitz","year":"1988","venue":"Proceedings of the Seventh AAAI National Conference on Artificial Intelligence -AAAI '88","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Knuth, 1998] Donald E. Knuth. The Art of Computer Pro- gramming, Volume 3 (2nd Ed.): Sorting and Searching. Addison Wesley Longman Publishing Co., Inc., 1998.","title":"The Art of Computer Programming","authors":"Donald E Knuth","year":"1998","venue":"Sorting and Searching","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Kuhn, 1955] Harold W. Kuhn. The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1-2):83-97, 1955.","title":"The hungarian method for the assignment problem","authors":"Harold W Kuhn","year":"1955","venue":"Naval Research Logistics Quarterly","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Mesrikhani and Farshi, 2018] Amir Mesrikhani and Moham- mad Farshi. Progressive sorting in the external memory model. The CSI Journal on Computer Science and Engi- neering, 15(2), 2018.","title":"Amir Mesrikhani and Mohammad Farshi. Progressive sorting in the external memory model","authors":"Farshi Mesrikhani","year":"2018","venue":"The CSI Journal on Computer Science and Engineering","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Moran and Yehudayoff, 2016] Shay Moran and Amir Yehu- dayoff. A note on average-case sorting. Order, 33(1):23-28, 2016.","title":"A note on average-case sorting","authors":"Shay Moran, Amir Yehudayoff","year":"2016","venue":"Order","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Peczarski, 2004] Marcin Peczarski. New results in minimum-comparison sorting. Algorithmica, 40(2):133- 145, 2004.","title":"Marcin Peczarski. New results in minimum-comparison sorting","authors":"Peczarski","year":"2004","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Peters and Procaccia, 2021] Dominik Peters and Ariel D. Procaccia. Preference elicitation as average-case sorting. In Proceedings of the AAAI Conference on Artificial In- telligence -AAAI '21, volume 35(6), pages 5647-5655, 2021.","title":"Preference elicitation as average-case sorting","authors":"Dominik Peters, Ariel D Procaccia","year":"2021","venue":"Proceedings of the AAAI Conference on Artificial Intelligence -AAAI '21","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Robertson, 1997] Stephen E. Robertson. The probability ranking principle in IR. Journal of Documentation 33, pages 294-304, 1997.","title":"The probability ranking principle in IR","authors":"Stephen E Robertson","year":"1997","venue":"Journal of Documentation","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Zilberstein, 1995] Shlomo Zilberstein. Optimizing decision quality with contract algorithms. In Proceedings of the Fourteenth International Joint Conference on Artificial In- telligence -IJCAI '95, pages 1576-1582, 1995.","title":"Optimizing decision quality with contract algorithms","authors":"Shlomo Zilberstein, Zilberstein","year":"1995","venue":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence -IJCAI '95","doi":null,"url":null,"internal_url":"/proceedings/1995/203"},{"position":24,"raw":"[Zilberstein, 1996] Shlomo Zilberstein. Using anytime algo- rithms in intelligent systems. AI Magazine, 17(3):73, 1996.","title":"Using anytime algorithms in intelligent systems","authors":"Shlomo Zilberstein","year":"1996","venue":"AI Magazine","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}