{"id":"https://openalex.org/W3035346927","doi":"https://doi.org/10.1145/3357713.3384299","title":"On the Nisan-Ronen conjecture for submodular valuations","display_name":"On the Nisan-Ronen conjecture for submodular valuations","publication_year":2020,"publication_date":"2020-06-22","ids":{"openalex":"https://openalex.org/W3035346927","doi":"https://doi.org/10.1145/3357713.3384299","mag":"3035346927"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384299","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384299","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-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/A5054751334","display_name":"George Christodoulou","orcid":"https://orcid.org/0000-0002-9623-7461"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"George Christodoulou","raw_affiliation_strings":["University of Liverpool, UK"],"affiliations":[{"raw_affiliation_string":"University of Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085074451","display_name":"\u0397\u03bb\u03af\u03b1\u03c2 \u039a\u03bf\u03c5\u03c4\u03c3\u03bf\u03c5\u03c0\u03b9\u03ac\u03c2","orcid":"https://orcid.org/0000-0002-2226-6737"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Elias Koutsoupias","raw_affiliation_strings":["University of Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103164764","display_name":"Annam\u00e1ria Kov\u00e1cs","orcid":"https://orcid.org/0009-0008-2990-988X"},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Annam\u00e1ria Kov\u00e1cs","raw_affiliation_strings":["Goethe University Frankfurt, Germany"],"affiliations":[{"raw_affiliation_string":"Goethe University Frankfurt, Germany","institution_ids":["https://openalex.org/I114090438"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054751334"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":null,"apc_paid":null,"fwci":1.0771,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.79669122,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1086","last_page":"1096"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9966999888420105,"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/T11031","display_name":"Game Theory and Applications","score":0.9825000166893005,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7853087186813354},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7845467329025269},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.659437894821167},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5533487796783447},{"id":"https://openalex.org/keywords/incentive-compatibility","display_name":"Incentive compatibility","score":0.5488078594207764},{"id":"https://openalex.org/keywords/valuation","display_name":"Valuation (finance)","score":0.4908967614173889},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4893147647380829},{"id":"https://openalex.org/keywords/impossibility","display_name":"Impossibility","score":0.4731769859790802},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4538513422012329},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4425727427005768},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4350399374961853},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3551318943500519},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3533390760421753},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.35108378529548645},{"id":"https://openalex.org/keywords/incentive","display_name":"Incentive","score":0.2373569905757904},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.10086148977279663}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7853087186813354},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7845467329025269},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.659437894821167},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5533487796783447},{"id":"https://openalex.org/C91810955","wikidata":"https://www.wikidata.org/wiki/Q7731670","display_name":"Incentive compatibility","level":3,"score":0.5488078594207764},{"id":"https://openalex.org/C186027771","wikidata":"https://www.wikidata.org/wiki/Q4008379","display_name":"Valuation (finance)","level":2,"score":0.4908967614173889},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4893147647380829},{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.4731769859790802},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4538513422012329},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4425727427005768},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4350399374961853},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3551318943500519},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3533390760421753},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.35108378529548645},{"id":"https://openalex.org/C29122968","wikidata":"https://www.wikidata.org/wiki/Q1414816","display_name":"Incentive","level":2,"score":0.2373569905757904},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.10086148977279663},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3357713.3384299","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384299","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1602132852","https://openalex.org/W1884453815","https://openalex.org/W1966092900","https://openalex.org/W2008409965","https://openalex.org/W2012634103","https://openalex.org/W2015007620","https://openalex.org/W2015654884","https://openalex.org/W2016245783","https://openalex.org/W2026375929","https://openalex.org/W2034780413","https://openalex.org/W2036744632","https://openalex.org/W2057087699","https://openalex.org/W2060824497","https://openalex.org/W2068852191","https://openalex.org/W2078040677","https://openalex.org/W2096141465","https://openalex.org/W2102201348","https://openalex.org/W2120100612","https://openalex.org/W2151792026","https://openalex.org/W2237099994","https://openalex.org/W2275395982","https://openalex.org/W2333413293","https://openalex.org/W2569519397","https://openalex.org/W2777733854","https://openalex.org/W2962711478","https://openalex.org/W3136264843","https://openalex.org/W3168376161","https://openalex.org/W4291695608","https://openalex.org/W4291982689","https://openalex.org/W4302422582","https://openalex.org/W6660143772"],"related_works":["https://openalex.org/W2384156839","https://openalex.org/W4321602641","https://openalex.org/W2394251275","https://openalex.org/W4241392912","https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2489497330","https://openalex.org/W2923536170","https://openalex.org/W2341342409","https://openalex.org/W4231095280"],"abstract_inverted_index":{"We":[0],"consider":[1],"incentive":[2,53],"compatible":[3,54],"mechanisms":[4,69,105],"for":[5,74,100],"a":[6,43,59,119,142],"domain":[7,14],"that":[8,24,70,85,127],"is":[9,23,31,58,79,116,141],"very":[10],"close":[11],"to":[12,130],"the":[13,20,25,34,49,65,75,80,90,147,151],"of":[15,27,46,52,68,104,123,135,150],"scheduling":[16,35],"n":[17],"unrelated":[18],"machines:":[19],"single":[21],"exception":[22],"valuation":[26],"just":[28],"one":[29],"machine":[30],"submodular.":[32],"For":[33],"problem":[36],"with":[37],"such":[38,106],"cost":[39],"functions,":[40],"we":[41],"give":[42],"lower":[44,83],"bound":[45,84],"\u03a9(\u221an)":[47],"on":[48,64,89,118,132],"approximation":[50,66],"ratio":[51,67],"deterministic":[55],"mechanisms.":[56,113],"This":[57,78],"strong":[60,72],"information-theoretic":[61],"impossibility":[62],"result":[63],"provides":[71],"evidence":[73],"Nisan-Ronen":[76],"conjecture.":[77,152],"first":[81],"non-constant":[82],"assumes":[86],"no":[87],"restriction":[88],"mechanism":[91],"side;":[92],"in":[93],"contrast,":[94],"all":[95],"previous":[96],"general":[97],"results":[98],"hold":[99],"only":[101],"special":[102],"classes":[103],"as":[107],"local,":[108],"strongly":[109],"monotone,":[110],"and":[111,139],"anonymous":[112],"Our":[114],"approach":[115],"based":[117],"novel":[120],"multi-player":[121],"characterization":[122],"appropriately":[124],"selected":[125],"instances":[126],"allows":[128],"us":[129],"focus":[131],"particular":[133],"type":[134],"algorithms,":[136],"linear":[137],"mechanisms,":[138],"it":[140],"potential":[143],"stepping":[144],"stone":[145],"towards":[146],"full":[148],"resolution":[149]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}