NDLI: A new strategy for querying priced information

Please wait, while we are loading the content...

Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors

Approximation techniques for utilitarian mechanism design

On lattices, learning with errors, random linear codes, and cryptography

On dynamic range reporting in one dimension

Beyond NP: the work and legacy of Larry Stockmeyer

Every monotone graph property is testable

Approximation algorithms for network design with metric costs

Optimal approximations of the frequency moments of data streams

Tree-walking automata do not recognize all regular languages

Simple PCPs with poly-log rate and query complexity

Computing the first Betti number and the connected components of semi-algebraic sets

The round complexity of two-party random selection

Learning with attribute costs

Undirected ST-connectivity in log-space

Universal approximations for TSP, Steiner tree, and set cover

Spectral norm of random matrices

Tensor norms and the classical communication complexity of nonlocal quantum measurement

Quadratic forms on graphs

Covert two-party computation

Euclidean distortion and the sparsest cut

Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits

Approximation algorithms for combinatorial auctions with complement-free bidders

An O(log n log log n) space algorithm for undirected st-connectivity

The complexity of agreement

A new strategy for querying priced information

From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement

Every 2-CSP allows nontrivial approximation

Extractors with weak random seeds

Computing correlated equilibria in multi-player games

Representing hard lattices with O(n log n) bits

Worst-case update times for fully-dynamic all-pairs shortest paths

Testing versus estimation of graph properties

On non-uniform multicommodity buy-at-bulk network design

Coresets in dynamic geometric data streams

Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read

Hardness of the undirected edge-disjoint paths problem

Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities

Hierarchies for semantic classes

Learning nonsingular phylogenies and hidden Markov models

Saving an epsilon: a 2-approximation for the k-MST problem in graphs

On random pm 1 matrices: singularity and determinant

Fast quantum algorithms for computing the unit group and class group of a number field

Lower-stretch spanning trees

On obfuscating point functions

Improved approximation algorithms for minimum-weight vertex separators

Limits to list decoding Reed-Solomon codes

Derandomization of auctions

Concurrent general composition of secure protocols in the timing model

Aggregating inconsistent information: ranking and clustering

An optimal multi-writer snapshot algorithm

Tensor decomposition and approximation schemes for constraint satisfaction problems

Pseudorandom generators for low degree polynomials

The Price of Routing Unsplittable Flow

Testing monotone high-dimensional distributions

Multicommodity flow, well-linked terminals, and routing problems

Low distortion embeddings for edit distance

Lower bounds for k-DNF resolution on random 3-CNFs

Hardness of the undirected congestion minimization problem

On algorithms for discrete and approximate brouwer fixed points

The mixing time of the thorp shuffle

On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem

Polynomial time quantum algorithm for the computation of the unit group of a number field

Edge partition of planar sraphs into two outerplanar graphs

New and improved constructions of non-malleable cryptographic protocols

O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems

Correcting errors without leaking partial information

On the bias of traceroute sampling: or, power-law degree distributions in regular graphs

Cooperative asynchronous update of shared memory

On strip packing With rotations

On uniform amplification of hardness in NP

The price of anarchy of finite congestion games

Efficient testing of groups

Oblivious routing in directed graphs with random demands

Low-distortion embeddings of general metrics into the line

Bounded-depth circuits: separating wires from gates

Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy

Convex programming for scheduling unrelated parallel machines

Approximately counting integral flows and cell-bounded contingency tables

Towards asymptotic optimality in probabilistic packet marking

Fast quantum byzantine agreement

Collusion-free protocols

Balanced metric labeling

Key agreement from weak bit agreement

How to spread adversarial nodes?: rotate!

Market equilibrium via the excess demand function

A new strategy for querying priced information

Content Provider	ACM Digital Library
Author	Laber, Eduardo Sany Cicalese, Ferdinando
Abstract	This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. The cost cx has to be paid to read the value of x. The problem is to design algorithms that query the values of the variables sequentially in order to compute the function while trying to minimize the total cost incurred. Competitive analysis is employed to evaluate the performance of the algorithms. We describe a novel approach for devising efficient algorithms in this setting. We apply our approach to several classes of functions which have been studied in the literature of computing with priced information. In all cases considered, our approach provides algorithms that achieve better bounds than the best known algorithm for the same class of functions.More precisely, for the class of monotone boolean functions, we give a polynomial time algorithm with extremal competitiveness (k+l - √ min(k,l)) where k (l) denotes the minimum number of variables that one must read, in the worst case, in order to prove that the function under consideration evaluates to 1 (0). This dramatically improves upon the best known result which is an exponential time 2 max(k, l)-competitive algorithm. For the subclass of monotone boolean functions known as Threshold Trees we further improve our bounds and give a polynomial time algorithm with extremal competitive ratio 1.618 max(k, l).We then apply our methodology to classes of non-boolean functions. We consider the case of the so called Game Trees. We improve upon previously published results for this class of functions providing a polynomial time algorithm with extremal competitive ratio 1.5 γ(f), where γ(f) is a lower bound on the extremal competitive ratio of any deterministic algorithm.Finally, we consider the case when f is the function min (minimum). In this case, we are able to determine the optimal competitiveness for the problem. In fact we provide an algorithm with an (n-2)-competitive ratio, which matches the known lower bound.
Starting Page	674
Ending Page	683
Page Count	10
File Format	PDF
ISBN	1581139608
DOI	10.1145/1060590.1060691
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2005-05-22
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Priced information Competitive analysis Monotone function
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in