{"id":"https://openalex.org/W2412083373","doi":"https://doi.org/10.1109/tc.2015.2479598","title":"Truthful Mechanisms for Competitive Reward-Based Scheduling","display_name":"Truthful Mechanisms for Competitive Reward-Based Scheduling","publication_year":2015,"publication_date":"2015-09-18","ids":{"openalex":"https://openalex.org/W2412083373","doi":"https://doi.org/10.1109/tc.2015.2479598","mag":"2412083373"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2015.2479598","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2015.2479598","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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/A5085589133","display_name":"Lena Mashayekhy","orcid":"https://orcid.org/0000-0002-5096-9333"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lena Mashayekhy","raw_affiliation_strings":["Department of Computer & Information Sciences, University of Delaware, Newark, DE"],"affiliations":[{"raw_affiliation_string":"Department of Computer & Information Sciences, University of Delaware, Newark, DE","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063909745","display_name":"Nathan Fisher","orcid":"https://orcid.org/0000-0002-9733-3842"},"institutions":[{"id":"https://openalex.org/I185443292","display_name":"Wayne State University","ror":"https://ror.org/01070mq45","country_code":"US","type":"education","lineage":["https://openalex.org/I185443292"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nathan Fisher","raw_affiliation_strings":["Department of Computer Science, Wayne State University, Detroit, MI"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Wayne State University, Detroit, MI","institution_ids":["https://openalex.org/I185443292"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030625845","display_name":"Daniel Grosu","orcid":"https://orcid.org/0000-0003-2340-5433"},"institutions":[{"id":"https://openalex.org/I185443292","display_name":"Wayne State University","ror":"https://ror.org/01070mq45","country_code":"US","type":"education","lineage":["https://openalex.org/I185443292"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Grosu","raw_affiliation_strings":["Department of Computer Science, Wayne State University, Detroit, MI"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Wayne State University, Detroit, MI","institution_ids":["https://openalex.org/I185443292"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5085589133"],"corresponding_institution_ids":["https://openalex.org/I86501945"],"apc_list":null,"apc_paid":null,"fwci":1.9969,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.88840251,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"65","issue":"7","first_page":"2299","last_page":"2312"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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.9991000294685364,"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/T11182","display_name":"Auction Theory and Applications","score":0.9976999759674072,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9876999855041504,"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/computer-science","display_name":"Computer science","score":0.8277271389961243},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6606638431549072},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5736205577850342},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4709136188030243},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46445417404174805},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4642435312271118},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4415714144706726},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43642759323120117},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37244948744773865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19134080410003662},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11378571391105652}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8277271389961243},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6606638431549072},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5736205577850342},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4709136188030243},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46445417404174805},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4642435312271118},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4415714144706726},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43642759323120117},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37244948744773865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19134080410003662},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11378571391105652},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.2015.2479598","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2015.2479598","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1372185653","display_name":null,"funder_award_id":"CNS-0953583","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5951037563","display_name":null,"funder_award_id":"CNS-1116787","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1549430717","https://openalex.org/W1910043916","https://openalex.org/W1941732106","https://openalex.org/W1965161364","https://openalex.org/W1977980414","https://openalex.org/W1982814022","https://openalex.org/W1984877922","https://openalex.org/W1988539619","https://openalex.org/W2012634103","https://openalex.org/W2015007620","https://openalex.org/W2041211404","https://openalex.org/W2041753950","https://openalex.org/W2062830639","https://openalex.org/W2077124610","https://openalex.org/W2078040677","https://openalex.org/W2087770658","https://openalex.org/W2096707344","https://openalex.org/W2101658191","https://openalex.org/W2109488193","https://openalex.org/W2117943181","https://openalex.org/W2120070938","https://openalex.org/W2120100612","https://openalex.org/W2123442845","https://openalex.org/W2126170153","https://openalex.org/W2130527052","https://openalex.org/W2142014495","https://openalex.org/W2142270691","https://openalex.org/W2142495422","https://openalex.org/W2153817930","https://openalex.org/W2163007708","https://openalex.org/W2166440675","https://openalex.org/W2621304102","https://openalex.org/W3098934080","https://openalex.org/W3104057238","https://openalex.org/W4236127247","https://openalex.org/W4241883994","https://openalex.org/W4251083239","https://openalex.org/W4253970008","https://openalex.org/W6646464481"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2048358792","https://openalex.org/W2098281589","https://openalex.org/W2970302286","https://openalex.org/W1481223916","https://openalex.org/W2732982824","https://openalex.org/W3123730328","https://openalex.org/W1443174385","https://openalex.org/W2962917430"],"abstract_inverted_index":{"We":[0,76,102,127],"consider":[1],"a":[2,19,28,50,61,138,176],"competitive":[3],"environment":[4],"for":[5,68,136],"reward-based":[6,79],"scheduling":[7,80],"of":[8,14,18,52,141,146,164,192],"periodic":[9],"tasks,":[10],"where":[11],"the":[12,31,46,78,88,94,117,151,156,161,165],"execution":[13,148],"each":[15],"task":[16,26,57,125],"consists":[17],"mandatory":[20,37],"and":[21,39,134,143],"an":[22,41,98,144],"optional":[23,54,74,100,147],"part.":[24,75],"Each":[25,56],"obtains":[27],"value":[29,44],"if":[30,45],"processor":[32,47],"successfully":[33,48],"schedules":[34,49],"all":[35],"its":[36,53,69,73],"part,":[38],"also":[40],"additional":[42],"reward":[43,153],"part":[51],"execution.":[55],"is":[58,114,175,190],"owned":[59],"by":[60,82,106,155],"self-interested":[62],"agent":[63,89],"who":[64],"has":[65],"multiple":[66],"choices":[67],"requests":[70],"based":[71],"on":[72],"model":[77],"problem":[81],"considering":[83],"such":[84],"multi-minded":[85],"agents.":[86],"However,":[87],"may":[90],"try":[91],"to":[92,96,121],"manipulate":[93],"system":[95],"obtain":[97],"unfair":[99],"allocation.":[101],"address":[103,160],"this":[104],"challenge":[105],"designing":[107],"novel":[108],"truthful":[109,130],"mechanisms":[110,131],"in":[111,116],"which":[112],"it":[113],"always":[115],"agent's":[118],"best":[119],"interest":[120],"report":[122],"their":[123],"true":[124],"characteristics.":[126],"propose":[128],"two":[129],"(an":[132],"exact":[133,166],"approximate)":[135],"selecting":[137],"feasible":[139],"subset":[140],"agents":[142],"allocation":[145],"that":[149,170,185],"maximizes":[150],"total":[152],"obtained":[154],"selected":[157],"tasks.":[158],"To":[159],"pseudo-polynomial":[162],"complexity":[163],"mechanism,":[167],"we":[168],"show":[169,184],"our":[171,186],"proposed":[172,187],"approximate":[173],"mechanism":[174,189],"polynomial-time":[177],"approximation":[178,188],"scheme":[179],"(PTAS).":[180],"Our":[181],"extensive":[182],"experiments":[183],"capable":[191],"finding":[193],"near-optimal":[194],"solutions":[195],"efficiently":[196],"while":[197],"guaranteeing":[198],"truthfulness.":[199]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}