20 results for “Competitive analysis”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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.
The Sleator-Tarjan model used in competitive analysis of paging is incorrect, and this error undermines the performance predictions for online paging algorithms.
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.…
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…
One clear sentence describing what this paper does
The paper presents a constant-competitive algorithm for the Matroid Secretary Problem on graphic matroids using only an independence oracle.
Develops a new deep learning method for survival analysis with competing risks, improving upon existing baselines.
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.
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…
This paper proposes a game-theoretic framework using Shapley Effects and Pareto front sets for interpretable hyperparameter-objective interaction analysis.
Evaluates the capabilities of language model agents in a simulated real-world task.