{"id":"https://openalex.org/W4406611008","doi":"https://doi.org/10.1007/s10878-025-01258-7","title":"Agent-constrained truthful facility location games","display_name":"Agent-constrained truthful facility location games","publication_year":2025,"publication_date":"2025-01-20","ids":{"openalex":"https://openalex.org/W4406611008","doi":"https://doi.org/10.1007/s10878-025-01258-7","pmid":"https://pubmed.ncbi.nlm.nih.gov/40092530"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-025-01258-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01258-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01258-7.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01258-7.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048361071","display_name":"Argyrios Deligkas","orcid":"https://orcid.org/0000-0002-6513-6748"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Argyrios Deligkas","raw_affiliation_strings":["Royal Holloway University of London, Egham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Holloway University of London, Egham, UK","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026802648","display_name":"Mohammad Lotfi","orcid":"https://orcid.org/0000-0001-8139-3683"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammad Lotfi","raw_affiliation_strings":["Sharif University of Technology, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090907162","display_name":"Alexandros A. Voudouris","orcid":"https://orcid.org/0000-0003-1105-3856"},"institutions":[{"id":"https://openalex.org/I110002522","display_name":"University of Essex","ror":"https://ror.org/02nkf1q06","country_code":"GB","type":"education","lineage":["https://openalex.org/I110002522"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Alexandros A. Voudouris","raw_affiliation_strings":["University of Essex, Colchester, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Essex, Colchester, UK","institution_ids":["https://openalex.org/I110002522"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090907162"],"corresponding_institution_ids":["https://openalex.org/I110002522"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00891864,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"49","issue":"2","first_page":"24","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9998000264167786,"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":0.9998000264167786,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game 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"}}],"keywords":[{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.8726094961166382},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7348673343658447},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6246525049209595},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5302051305770874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5110474824905396},{"id":"https://openalex.org/keywords/1-center-problem","display_name":"1-center problem","score":0.47939276695251465},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4378725588321686},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4196015000343323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3874218761920929},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34000396728515625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13165849447250366}],"concepts":[{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.8726094961166382},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7348673343658447},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6246525049209595},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5302051305770874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5110474824905396},{"id":"https://openalex.org/C50524431","wikidata":"https://www.wikidata.org/wiki/Q4545814","display_name":"1-center problem","level":3,"score":0.47939276695251465},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4378725588321686},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4196015000343323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3874218761920929},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34000396728515625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13165849447250366},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10878-025-01258-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01258-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01258-7.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmid:40092530","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/40092530","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of combinatorial optimization","raw_type":null},{"id":"pmh:oai:pubmedcentral.nih.gov:11906575","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/11906575","pdf_url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC11906575/pdf/10878_2025_Article_1258.pdf","source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"J Comb Optim","raw_type":"Text"},{"id":"pmh:oai:RePEc:spr:jcomop:v:49:y:2025:i:2:d:10.1007_s10878-025-01258-7","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-025-01258-7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10878-025-01258-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01258-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01258-7.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G6486380922","display_name":"NAfANE: New Approaches for Approximate Nash Equilibria","funder_award_id":"EP/X039862/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320314731","display_name":"UK Research and Innovation","ror":"https://ror.org/001aqnf71"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4406611008.pdf"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1536918079","https://openalex.org/W2037655822","https://openalex.org/W2154843747","https://openalex.org/W2221730244","https://openalex.org/W2345018925","https://openalex.org/W2788175665","https://openalex.org/W3034970181","https://openalex.org/W3092939383","https://openalex.org/W3114602600","https://openalex.org/W3130513340","https://openalex.org/W3190009554","https://openalex.org/W4226055524","https://openalex.org/W4249659175","https://openalex.org/W4281480833","https://openalex.org/W4323349625","https://openalex.org/W4362588740","https://openalex.org/W4379984284","https://openalex.org/W4386955407","https://openalex.org/W4390038285","https://openalex.org/W4391490918"],"related_works":["https://openalex.org/W2083833523","https://openalex.org/W276709744","https://openalex.org/W2006514056","https://openalex.org/W2057791178","https://openalex.org/W4385597667","https://openalex.org/W2074682523","https://openalex.org/W2173317315","https://openalex.org/W2476148062","https://openalex.org/W4248426730","https://openalex.org/W1509863433"],"abstract_inverted_index":{"We":[0],"consider":[1],"a":[2,11,30,48],"truthful":[3],"facility":[4,73],"location":[5],"game":[6],"in":[7,89],"which":[8],"there":[9],"is":[10,27,58],"set":[12,40],"of":[13,21,32,41,86,91,99],"agents":[14],"with":[15],"private":[16],"locations":[17,36],"on":[18,82],"the":[19,25,39,45,71,83,92,95,100],"line":[20],"real":[22],"numbers,":[23],"and":[24],"goal":[26],"to":[28,63,70],"place":[29],"number":[31],"facilities":[33,65],"at":[34],"different":[35],"chosen":[37],"from":[38],"those":[42],"reported":[43],"by":[44],"agents.":[46,101],"Given":[47],"feasible":[49],"solution,":[50],"each":[51],"agent":[52],"suffers":[53],"an":[54],"individual":[55,97],"cost":[56,98],"that":[57],"either":[59],"its":[60,68],"total":[61,96],"distance":[62,69],"all":[64],"(sum-variant)":[66],"or":[67],"farthest":[72],"(max-variant).":[74],"For":[75],"both":[76],"variants,":[77],"we":[78],"show":[79],"tight":[80],"bounds":[81],"approximation":[84],"ratio":[85],"strategyproof":[87],"mechanisms":[88],"terms":[90],"social":[93],"cost,":[94]},"counts_by_year":[],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}