{"id":"https://openalex.org/W2054391049","doi":"https://doi.org/10.1109/coase.2013.6654073","title":"Stackelberg game formulation of prize competition design for seeking shortest path solutions","display_name":"Stackelberg game formulation of prize competition design for seeking shortest path solutions","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W2054391049","doi":"https://doi.org/10.1109/coase.2013.6654073","mag":"2054391049"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2013.6654073","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2013.6654073","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5056821570","display_name":"Ting-Yu Ho","orcid":null},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Ting-Yu Ho","raw_affiliation_strings":["Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan ROC","Dept. of Electr. Eng.. Nat. Taiwan Univ., Taipei, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan ROC","institution_ids":["https://openalex.org/I16733864"]},{"raw_affiliation_string":"Dept. of Electr. Eng.. Nat. Taiwan Univ., Taipei, Taiwan","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089159973","display_name":"Shi\u2010Chung Chang","orcid":"https://orcid.org/0000-0001-7595-2485"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Shi-Chung Chang","raw_affiliation_strings":["Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan ROC","Dept. of Electr. Eng.. Nat. Taiwan Univ., Taipei, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan ROC","institution_ids":["https://openalex.org/I16733864"]},{"raw_affiliation_string":"Dept. of Electr. Eng.. Nat. Taiwan Univ., Taipei, Taiwan","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16733864"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"54","issue":null,"first_page":"374","last_page":"379"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10646","display_name":"Experimental Behavioral Economics Studies","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10646","display_name":"Experimental Behavioral Economics Studies","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9919000267982483,"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/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/stackelberg-competition","display_name":"Stackelberg competition","score":0.8975871205329895},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7968872785568237},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.662969708442688},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5639232993125916},{"id":"https://openalex.org/keywords/competition","display_name":"Competition (biology)","score":0.5555962920188904},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5224484801292419},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5216907858848572},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.48506417870521545},{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.47579726576805115},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.4562339782714844},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.34894734621047974},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3040009140968323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2352488934993744},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21265915036201477},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20985591411590576}],"concepts":[{"id":"https://openalex.org/C199510392","wikidata":"https://www.wikidata.org/wiki/Q1184602","display_name":"Stackelberg competition","level":2,"score":0.8975871205329895},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7968872785568237},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.662969708442688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5639232993125916},{"id":"https://openalex.org/C91306197","wikidata":"https://www.wikidata.org/wiki/Q45767","display_name":"Competition (biology)","level":2,"score":0.5555962920188904},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5224484801292419},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5216907858848572},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.48506417870521545},{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.47579726576805115},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.4562339782714844},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.34894734621047974},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3040009140968323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2352488934993744},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21265915036201477},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20985591411590576},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coase.2013.6654073","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2013.6654073","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W633149616","https://openalex.org/W1567268701","https://openalex.org/W2013571204","https://openalex.org/W2112177229","https://openalex.org/W2169528473","https://openalex.org/W2260964331","https://openalex.org/W4230999097","https://openalex.org/W4239276191","https://openalex.org/W6634115322","https://openalex.org/W6681189538","https://openalex.org/W7055378176"],"related_works":["https://openalex.org/W2018146256","https://openalex.org/W2388410942","https://openalex.org/W2156431668","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2040572217","https://openalex.org/W2767202586","https://openalex.org/W191849398","https://openalex.org/W1966110800","https://openalex.org/W2022506245"],"abstract_inverted_index":{"Prize":[0],"competitions":[1,105],"have":[2],"been":[3],"an":[4,32],"open":[5],"approach":[6],"of":[7,24,44,50,66,75,117,140,157,180,209],"soliciting":[8],"expertise":[9],"and":[10,56,70,80,102,159,189,205],"creativity":[11],"from":[12],"the":[13,76,94,97,138,144,155,162,169,184,203,207],"public":[14],"to":[15,109,130,215],"increase":[16],"business":[17],"success":[18],"or":[19],"solve":[20],"problems.":[21],"In":[22,164],"spite":[23],"many":[25],"successes,":[26],"there":[27],"are":[28],"yet":[29],"needs":[30],"for":[31,174,213],"effective":[33],"design":[34,212],"methodology.":[35],"To":[36,87],"investigate":[37],"methodology":[38],"development,":[39],"we":[40,167],"consider":[41],"a":[42,62,67,82,192],"problem":[43,173],"shortest":[45,111,127,147],"path":[46,52,84,90,112,141,148,158],"solution":[47,53],"seeking":[48],"consisting":[49],"one":[51,125],"seeker":[54],"(PSS)":[55],"multiple":[57],"providers":[58],"(PSPs).":[59],"PSS":[60,95,119,175,188],"has":[61,81],"coarse":[63],"overall":[64],"grasp":[65],"transportation":[68],"network":[69,77,98],"each":[71,151],"PSP":[72,145],"knows":[73],"part":[74],"in":[78,106,150],"detail":[79],"good":[83],"finding":[85],"capacity.":[86],"find":[88],"short":[89],"between":[91,187],"two":[92],"cities,":[93],"divides":[96],"into":[99,124],"several":[100],"sections":[101,108],"holds":[103],"prize":[104,171,210],"all":[107],"solicit":[110],"solutions":[113,123],"among":[114],"specified":[115],"pairs":[116],"cities.":[118],"further":[120,199],"connects":[121],"procured":[122],"desired":[126],"path.":[128],"Moreover,":[129],"protect":[131],"PSPs'":[132],"intellectual":[133],"rights,":[134],"they":[135],"first":[136],"submit":[137],"distance":[139],"only.":[142],"Then":[143],"with":[146],"submission":[149,178],"section":[152],"turns":[153],"over":[154],"route":[156],"is":[160],"awarded":[161],"prize.":[163],"this":[165],"paper,":[166],"formulate":[168],"optimal":[170],"setting":[172],"considering":[176],"competitive":[177],"strategies":[179],"PSPs.":[181],"We":[182],"model":[183,204],"hierarchical":[185],"behaviors":[186],"PSPs":[190],"as":[191],"Stackelberg":[193,195],"game.":[194],"equilibrium":[196],"can":[197],"be":[198],"investigated":[200],"based":[201],"on":[202],"serve":[206],"purpose":[208],"competition":[211],"applications":[214],"collective":[216],"innovation":[217],"seeking.":[218]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}