{"id":"https://openalex.org/W2121427971","doi":"https://doi.org/10.1137/s0097539797314465","title":"Optimal Information Gathering on the Internet with Time and Cost Constraints","display_name":"Optimal Information Gathering on the Internet with Time and Cost Constraints","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2121427971","doi":"https://doi.org/10.1137/s0097539797314465","mag":"2121427971"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539797314465","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797314465","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110184338","display_name":"Oren Etzioni","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Oren Etzioni","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003940964","display_name":"Steve Hanks","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Steve Hanks","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101911266","display_name":"Tao Jiang","orcid":"https://orcid.org/0000-0003-3833-4498"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tao Jiang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5030263413","display_name":"Omid Madani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Omid Madani","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5110184338"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4286,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.75267054,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"5","first_page":"1596","last_page":"1620"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.5792219042778015},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5419323444366455},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32046234607696533},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.2600955367088318}],"concepts":[{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.5792219042778015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5419323444366455},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32046234607696533},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.2600955367088318}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539797314465","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797314465","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.36.8965","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.8965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.washington.edu/homes/madani/papers/scheduling_journal.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.5299999713897705,"display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1550771877","https://openalex.org/W1977027322","https://openalex.org/W2013899899","https://openalex.org/W2026891055","https://openalex.org/W2034424699","https://openalex.org/W2041683889","https://openalex.org/W2089047615","https://openalex.org/W2092923996","https://openalex.org/W2171322305","https://openalex.org/W2174595797","https://openalex.org/W2798329707"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2350741829","https://openalex.org/W2530322880","https://openalex.org/W1596801655"],"abstract_inverted_index":{"The":[0,184,286],"World":[1],"Wide":[2],"Web":[3],"provides":[4],"access":[5],"to":[6,61,78,93,131,141,187,210,234,256,311],"vast":[7],"amounts":[8],"of":[9,31,35,44,49,95,99,111,117,150,159,196,205,230,283,288],"information,":[10],"but":[11],"content":[12],"providers":[13],"are":[14,309],"considering":[15],"charging":[16],"for":[17,37,294,304,322,356,370],"the":[18,25,29,33,40,58,62,79,83,108,113,115,123,126,133,147,151,160,163,169,173,182,197,206,226,231,235,238,250,257,260,273,279,284],"information":[19,38,71,101],"and":[20,47,122,146,172,176,217,267,278,298,307,316,339,350,360],"services":[21],"they":[22],"supply.":[23],"Thus":[24],"consumer":[26],"may":[27],"face":[28],"problem":[30,185],"balancing":[32],"benefit":[34,77,207],"asking":[36],"against":[39],"cost":[41,110,175,216,229,262,277],"(in":[42],"terms":[43],"both":[45,214],"money":[46],"time)":[48],"acquiring":[50],"it.":[51],"We":[52,192],"study":[53],"information-gathering":[54],"strategies":[55],"that":[56,125,162,237,259],"maximize":[57],"expected":[59,148,170,227,251,274,280],"value":[60,149],"consumer.":[63,80],"In":[64],"our":[65],"model":[66],"there":[67],"is":[68,186,223,247,270],"a":[69,75,96,318,326,351],"single":[70],"request,":[72,84],"which":[73,139,144],"has":[74],"known":[76],"To":[81],"satisfy":[82],"queries":[85],"can":[86,153],"be":[87,129,154,312],"sent":[88],"simultaneously":[89],"or":[90],"in":[91,225,249,272],"sequence":[92],"any":[94],"finite":[97],"set":[98],"independent":[100],"sources.":[102],"For":[103,314,332],"each":[104],"source":[105,127],"we":[106,324,334],"know":[107],"monetary":[109,174,276],"making":[112],"query,":[114],"amount":[116],"time":[118,177,241,254,281,329,344,353,364],"it":[119],"will":[120,128,165],"take,":[121],"probability":[124],"able":[130],"provide":[132],"requested":[134],"information.":[135],"A":[136],"policy":[137,152,164,232,293,303],"specifies":[138],"sources":[140],"contact":[142],"at":[143],"times,":[145],"defined":[155],"as":[156],"some":[157,265],"function":[158,199],"likelihood":[161],"yield":[166],"an":[167,189,290,300,341,361],"answer,":[168],"benefit,":[171],"delay":[178,282],"associated":[179],"with":[180,317,347,367],"executing":[181],"policy.":[183,191,285],"find":[188],"expected-value-maximizing":[190],"explore":[193],"four":[194,296],"variants":[195,297,305],"objective":[198],"V:":[200],"(i)":[201],"V":[202,222,246,269],"consists":[203],"only":[204],"term":[208],"subject":[209,233,255],"threshold":[211],"constraints":[212],"on":[213],"total":[215,218,228,239,252,261,275],"elapsed":[219,240,253],"time,":[220],"(ii)":[221],"linear":[224,248,271],"constraint":[236,258],"never":[242,263],"exceeds":[243,264],"somedeadline,":[244],"(iii)":[245,306],"threshold,":[266],"(iv)":[268,308],"problems":[287],"devising":[289],"optimal":[291,301,357,371],"querying":[292,302,337],"all":[295],"approximating":[299],"shown":[310],"NP-hard.":[313],"(i),":[315],"mild":[319],"simplifying":[320],"assumption":[321],"(iii),":[323],"give":[325],"fully":[327],"polynomial":[328,352],"approximation":[330,345,354,365],"scheme.":[331],"(ii),":[333],"consider":[335],"batched":[336],"policies,":[338,359],"design":[340],"O(n2":[342],")":[343,363],"algorithm":[346,366],"ratio":[348,368],"$\\frac{1}{2}$":[349],"scheme":[355],"single-batch":[358],"O(kn2":[362],"$\\frac{1}{5}$":[369],"k-batch":[372],"policies.":[373]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}