Results 11 to 20 of about 289,907 (302)
A Competitive Ratio for Quantifying Competition Between Intercrops [PDF]
Experimental Agriculture, 1980 SUMMARYA simple competitive ratio (CR) is proposed as a measure of intercrop competition, to indicate the number of times by which one component crop is more competitive than the other. Intercropping data show that this CR term could be useful in (i) comparing the competitive ability of different crops, (ii) measuring competitive changes within a given
Willey, R W, Rao, M R
openaire +3 more sources
On the Competitive Ratio for Online Facility Location [PDF]
Algorithmica, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fotakis, D. +2 more
openaire +3 more sources
Buying a Constant Competitive Ratio for Paging [PDF]
, 2001 We consider a variant of the online paging problem where the online algorithm may buy additional cache slots at a certain cost. The overall cost incurred equals the total cost for the cache plus the number of page faults. This problem and our results are a generalization of both, the classical paging problem and the ski rental problem.
Csirik, János +4 more
openaire +2 more sources
On the competitive ratio of evaluating priced functions [PDF]
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06, 2006 Let f be a function on a set of variables V . For each x ∈ V , let c(x) be the cost of reading the value of x .
Cicalese, Ferdinando, Eduardo Laber
openaire +6 more sources
The Accommodating Function: A Generalization of the Competitive Ratio
SIAM Journal on Computing, 1999 Summary: A new measure, the accommodating function, for the quality of on-line algorithms is presented. The accommodating function, which is a generalization of both the competitive ratio and the competitive ratio on accommodating sequences, measures the quality of an on-line algorithm as a function of the resources that would be sufficient for an ...
Joan Boyar +2 more
openaire +3 more sources
On the Competitive Ratio of Online Sampling Auctions
ACM Transactions on Economics and Computation, 2010 We study online profit-maximizing auctions for digital goods with adversarial bid selection and uniformly random arrivals; in this sense, our model lies at the intersection of prior-free mechanism design and secretary problems. Our goal is to design auctions that are constant competitive with F (2) .
Koutsoupias, E., Pierrakos, G.
openaire +5 more sources
On the Competitive Ratio of the Random Sampling Auction [PDF]
, 2005 We give a simple analysis of the competitive ratio of the random sampling auction from [10]. The random sampling auction was first shown to be worst-case competitive in [9] (with a bound of 7600 on its competitive ratio); our analysis improves the bound to 15.
Uriel Feige +3 more
openaire +2 more sources
An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio
CoRR, 2023 The problem of sorting with priced information was introduced by [Charikar, Fagin, Guruswami, Kleinberg, Raghavan, Sahai (CFGKRS), STOC 2000]. In this setting, different comparisons have different (potentially infinite) costs. The goal is to find a sorting algorithm with small competitive ratio, defined as the (worst-case) ratio of the algorithm's cost
Jacob, Riko, Goswami, Mayank
openaire +5 more sources
A Tight Competitive Ratio for Online Submodular Welfare Maximization [PDF]
CoRR, 2023 In this paper we consider the online Submodular Welfare (SW) problem. In this problem we are given $n$ bidders each equipped with a general (not necessarily monotone) submodular utility and $m$ items that arrive online. The goal is to assign each item, once it arrives, to a bidder or discard it, while maximizing the sum of utilities.
Ganz, Amit, Nuti, Pranav, Schwartz, Roy
core +7 more sources
Improved Competitive Ratio for the Matroid Secretary Problem
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012 The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presented to an on-line algorithm in a random order.
Sourav Chakraborty 0001, Oded Lachish
openaire +2 more sources