{"id":"https://openalex.org/W2013536758","doi":"https://doi.org/10.1137/130913602","title":"Utilitarian Mechanism Design for Multiobjective Optimization","display_name":"Utilitarian Mechanism Design for Multiobjective Optimization","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2013536758","doi":"https://doi.org/10.1137/130913602","mag":"2013536758"},"language":"en","primary_location":{"id":"doi:10.1137/130913602","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130913602","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":true,"oa_status":"green","oa_url":"https://art.torvergata.it/bitstream/2108/122412/1/GKLVsicomp.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034276567","display_name":"Fabrizio Grandoni","orcid":"https://orcid.org/0000-0002-9676-4931"},"institutions":[{"id":"https://openalex.org/I57201433","display_name":"Universit\u00e0 della Svizzera italiana","ror":"https://ror.org/03c4atk17","country_code":"CH","type":"education","lineage":["https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Fabrizio Grandoni","raw_affiliation_strings":["University of Lugano,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Lugano,#TAB#","institution_ids":["https://openalex.org/I57201433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079362010","display_name":"Piotr Krysta","orcid":"https://orcid.org/0000-0002-1498-9994"},"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":false,"raw_author_name":"Piotr Krysta","raw_affiliation_strings":["#N##TAB##TAB##TAB##TAB# University of Liverpool#N##TAB##TAB##TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# University of Liverpool#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102836759","display_name":"Stefano Leonardi","orcid":"https://orcid.org/0000-0002-9809-7191"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stefano Leonardi","raw_affiliation_strings":["Computer, Control and Management Engineering Antonio Ruberti"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer, Control and Management Engineering Antonio Ruberti","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001328914","display_name":"Carmine Ventre","orcid":"https://orcid.org/0000-0003-1464-1215"},"institutions":[{"id":"https://openalex.org/I874055015","display_name":"Teesside University","ror":"https://ror.org/03z28gk75","country_code":"GB","type":"education","lineage":["https://openalex.org/I874055015"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Carmine Ventre","raw_affiliation_strings":["Univ. of Teesside"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. of Teesside","institution_ids":["https://openalex.org/I874055015"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6807,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.85520901,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"43","issue":"4","first_page":"1263","last_page":"1290"},"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.9970999956130981,"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/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.9959999918937683,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7210207581520081},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.6636910438537598},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.6114888787269592},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5133153796195984},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4636266231536865},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.43888360261917114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4351135492324829},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.43502774834632874},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4327852427959442},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.430502712726593},{"id":"https://openalex.org/keywords/mechanism-design","display_name":"Mechanism design","score":0.4128156304359436},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.41071683168411255},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.09343680739402771}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7210207581520081},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6636910438537598},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.6114888787269592},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5133153796195984},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4636266231536865},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.43888360261917114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4351135492324829},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.43502774834632874},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4327852427959442},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.430502712726593},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.4128156304359436},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.41071683168411255},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.09343680739402771},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1137/130913602","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130913602","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:https://research.tees.ac.uk/ws/oai:openaire/cc8b3363-1bc5-4df3-ab61-832e3e3dde16","is_oa":false,"landing_page_url":"https://research.tees.ac.uk/en/publications/cc8b3363-1bc5-4df3-ab61-832e3e3dde16","pdf_url":null,"source":{"id":"https://openalex.org/S4306401198","display_name":"TeesRep (Teesside University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I874055015","host_organization_name":"Teesside University","host_organization_lineage":["https://openalex.org/I874055015"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Grandoni, F, Krysta, P, Leonardi, S & Ventre, C 2014, 'Utilitarian Mechanism Design for Multiobjective Optimization', SIAM Journal on Computing, vol. 43, no. 4, pp. 1263-. https://doi.org/10.1137/130913602","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:art.torvergata.it:2108/122412","is_oa":true,"landing_page_url":"http://hdl.handle.net/2108/122412","pdf_url":"https://art.torvergata.it/bitstream/2108/122412/1/GKLVsicomp.pdf","source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.721.176","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.721.176","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.idsia.ch/%7Egrandoni/Pubblicazioni/GKLVsicomp.pdf","raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/367745","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/367745","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:iris.uniroma1.it:11573/844717","is_oa":false,"landing_page_url":"http://epubs.siam.org/doi/pdf/10.1137/130913602","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"info:eu-repo/semantics/article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/ddca2f91-6ca4-448a-a77b-760cbc247347","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/ddca2f91-6ca4-448a-a77b-760cbc247347","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Grandoni, F, Krysta, P, Leonardi, S & Ventre, C 2014, 'Utilitarian mechanism design for multiobjective optimization', SIAM JOURNAL ON COMPUTING, vol. 43, no. 4, pp. 1263-1290. https://doi.org/10.1137/130913602","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:tees.openrepository.com:10149/608822","is_oa":false,"landing_page_url":"http://hdl.handle.net/10149/608822","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:art.torvergata.it:2108/122412","is_oa":true,"landing_page_url":"http://hdl.handle.net/2108/122412","pdf_url":"https://art.torvergata.it/bitstream/2108/122412/1/GKLVsicomp.pdf","source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.4699999988079071,"display_name":"Partnerships for the goals"}],"awards":[{"id":"https://openalex.org/G1122742648","display_name":null,"funder_award_id":"EP/F069502/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G1945964198","display_name":"Efficient Algorithms for Mechanism Design Without Monetary Transfer","funder_award_id":"EP/K01000X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3569601956","display_name":null,"funder_award_id":"317532","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5322969123","display_name":"Algorithmic Mechanism Design and Optimization Problems with Economic Applications","funder_award_id":"EP/F069502/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8025662718","display_name":null,"funder_award_id":"EP/K01000X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G828397419","display_name":null,"funder_award_id":"K01000X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2013536758.pdf","grobid_xml":"https://content.openalex.org/works/W2013536758.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1977980414","https://openalex.org/W1988698339","https://openalex.org/W1990326103","https://openalex.org/W2001139415","https://openalex.org/W2007201570","https://openalex.org/W2015007620","https://openalex.org/W2034053794","https://openalex.org/W2039634593","https://openalex.org/W2041211404","https://openalex.org/W2047031390","https://openalex.org/W2062830639","https://openalex.org/W2063245286","https://openalex.org/W2063807274","https://openalex.org/W2065980363","https://openalex.org/W2066047491","https://openalex.org/W2074117023","https://openalex.org/W2078040677","https://openalex.org/W2087770658","https://openalex.org/W2104399828","https://openalex.org/W2118656253","https://openalex.org/W2120100612","https://openalex.org/W2130626677","https://openalex.org/W2143712765"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W2098281589","https://openalex.org/W3155769677","https://openalex.org/W2068707503","https://openalex.org/W1223758158","https://openalex.org/W2027111774"],"abstract_inverted_index":{"In":[0,83,100,112],"a":[1,56,63,77,94,118,123,137,149],"classic":[2],"optimization":[3,25,60,110,135,178],"problem":[4,61],"the":[5,15,29,34,59,68,73,81,88,98,167,171,195],"complete":[6],"input":[7,35,74],"data":[8,36,75],"is":[9,37,50,76,136,162],"assumed":[10],"to":[11,14,51,58,189],"be":[12,21,93],"known":[13],"algorithm.":[16],"This":[17],"assumption":[18],"may":[19],"not":[20],"true":[22],"anymore":[23],"in":[24],"problems":[26],"motivated":[27],"by":[28],"Internet":[30],"where":[31],"part":[32],"of":[33,40,46,65,85,97,125,159,166,173,197],"private":[38],"knowledge":[39],"independent":[41],"selfish":[42],"agents.":[43,82],"The":[44,156],"goal":[45],"algorithmic":[47],"mechanism":[48,106,141],"design":[49,107,142,172],"provide":[52],"(in":[53],"polynomial":[54],"time)":[55],"solution":[57,89],"and":[62,122,184,205],"set":[64,124],"incentives":[66],"for":[67,80,108,140,148,170,176],"agents":[69],"such":[70],"that":[71,164],"disclosing":[72],"dominant":[78],"strategy":[79],"case":[84],"NP-hard":[86],"problems,":[87,179],"computed":[90],"should":[91],"also":[92],"good":[95],"approximation":[96,191],"optimum.":[99],"this":[101,113,160],"paper":[102,161],"we":[103,115,201],"focus":[104],"on":[105],"multi-objective":[109,177],"problems.":[111],"setting":[114,139],"are":[116,129],"given":[117],"main":[119,157,168],"objective":[120],"function,":[121],"secondary":[126],"objectives":[127],"which":[128],"modeled":[130],"via":[131],"budget":[132],"constraints.":[133],"Multi-objective":[134],"natural":[138],"as":[143],"many":[144],"economical":[145],"choices":[146],"ask":[147],"compromise":[150],"between":[151],"different,":[152],"partially":[153],"conflicting":[154],"goals.":[155],"contribution":[158],"showing":[163],"two":[165],"tools":[169],"approxi-mation":[174],"algorithms":[175],"namely":[180],"approximate":[181,198],"Pareto":[182,199],"sets":[183],"Lagrangian":[185],"relaxation,":[186],"can":[187],"lead":[188],"truthful":[190,203],"schemes.":[192],"By":[193],"exploiting":[194],"method":[196],"sets,":[200],"devise":[202],"deterministic":[204],"ran-":[206]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}