ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Competitive analysis”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DSTheoreticalRecentAug 5, 2026

The Greedy Binary Search Tree is Non-trivially Competitive

Yuhao Guo, Seth Pettie, Daniel Skora, Chengzhang Wan

This paper proves the competitiveness of Greedy binary search tree as 2^(O(sqrt(loglog n))), improving upon the widely held belief of O(1)-competitiveness.

View →
cs.DSTheoreticalRecentJun 22, 2026

Is competitive online paging an artifact?

Enoch Peserico, Michele Scquizzato

The Sleator-Tarjan model used in competitive analysis of paging is incorrect, and this error undermines the performance predictions for online paging algorithms.

View →
cs.LGmath.ATstat.MLEmpiricalRecentJul 26, 2026

Topological Data Analysis and Graph-Theoretic Approaches for Tennis Match Prediction

Jake Schwaderer, Alexander Bastien, Omid Khormali, Alejandro Navarrete +2 more

The paper proposes two methods for predicting tennis match outcomes using topological data analysis and graph theory. The first method uses lower-star filtration and persistent homology, achieving 66.…

View →
cs.GTcs.CCTheoreticalRecentNov 12, 2026

The Tournament Equilibrium Set Is PSPACE-Complete, Even under Hereditary Uniqueness

Ethan Dickey, Athina Terzoglou

This paper proves that the problem of deciding whether a given alternative belongs to the tournament equilibrium set (TEQ) is PSPACE-complete, and studies the complexity of the problem under different…

View →
cs.DSEmpiricalRecentJun 23, 2026

Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model

Felix Buld, Andreas S. Schulz

One clear sentence describing what this paper does

View →
cs.DSTheoreticalRecentAug 11, 2026

Graphic Matroid Secretary without the Graph

Paul Dütting, Renato Paes Leme, Martin Pál, Neel Patel

The paper presents a constant-competitive algorithm for the Matroid Secretary Problem on graphic matroids using only an independence oracle.

View →
stat.MLcs.LGEmpiricalRecentOct 16, 2026

The Loss or the Architecture? What Matters in Survival Analysis with Competing Risks

Julie Alberge, Gaël Varoquaux, Judith Abécassis

Develops a new deep learning method for survival analysis with competing risks, improving upon existing baselines.

View →
cs.AIcs.GTEmpiricalRecentJul 7, 2026

FootsiesGym: A Fighting Game Benchmark for Two-Player Zero-Sum Imperfect-Information Games

Chase McDonald, Nathan Tsang, Wesley N. Kerr

The paper introduces FootsiesGym, an open-source environment for learning in a two-player, zero-sum, imperfect-information game, providing a vectorized simulator for efficient analysis.

View →
cs.DSTheoreticalRecentJun 26, 2026

Incremental Submodular Maximization: Better Than Greedy

Marcin Bienkowski, Joakim Blikstad, Jarosław Byrka, Martín Costa +2 more

The paper presents an adaptive scaling algorithm with a competitive ratio of 1.373 for incremental submodular maximization under increasing cardinality constraint, improving upon the previous best res…

View →
stat.MLcs.LGstat.COTheoreticalRecentJul 17, 2026

Which Hyperparameters Matter? A Game-Theoretic Framework for Interpretable Hyperparameter Sensitivity Analysis

Nyi Nyi Aung, Heepeom Shin, Abigail Lawlor, Adrian Stein

This paper proposes a game-theoretic framework using Shapley Effects and Pareto front sets for interpretable hyperparameter-objective interaction analysis.

View →
cs.AIcs.CLcs.SEEmpiricalRecentJun 16, 2026

CEO-Bench: Can Agents Play the Long Game?

Haozhe Chen, Karthik Narasimhan, Zhuang Liu

Evaluates the capabilities of language model agents in a simulated real-world task.

View →