{"id":"https://openalex.org/W3136595833","doi":"https://doi.org/10.1007/978-3-030-30473-7_6","title":"Obvious Strategyproofness, Bounded Rationality and Approximation","display_name":"Obvious Strategyproofness, Bounded Rationality and Approximation","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W3136595833","doi":"https://doi.org/10.1007/978-3-030-30473-7_6","mag":"3136595833"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-30473-7_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-30473-7_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://kclpure.kcl.ac.uk/ws/files/116962259/Obvious_Strategyproofness_Bounded_Rationality_FERRAIOLI_Accepted1July2019Publishedonline16September2019_GREEN_AAM.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044085723","display_name":"Diodato Ferraioli","orcid":"https://orcid.org/0000-0002-7962-5200"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Diodato Ferraioli","raw_affiliation_strings":["Universit\u00e0 degli Studi di Salerno, Fisciano, SA, Italy"],"raw_orcid":"https://orcid.org/0000-0002-7962-5200","affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli Studi di Salerno, Fisciano, SA, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"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/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Carmine Ventre","raw_affiliation_strings":["King\u2019s College London, London, UK","King's College London, London, UK"],"raw_orcid":"https://orcid.org/0000-0003-1464-1215","affiliations":[{"raw_affiliation_string":"King\u2019s College London, London, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"King's College London, London, UK","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044085723"],"corresponding_institution_ids":["https://openalex.org/I131729948"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":3.0007,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.94778375,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"77","last_page":"91"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9998999834060669,"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.9998999834060669,"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.9945999979972839,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"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.7466426491737366},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6872144341468811},{"id":"https://openalex.org/keywords/bounded-rationality","display_name":"Bounded rationality","score":0.649349570274353},{"id":"https://openalex.org/keywords/rationality","display_name":"Rationality","score":0.5414140224456787},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.36508941650390625},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35929808020591736},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35434690117836},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3322077989578247},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16080889105796814},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.08360931277275085},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07600095868110657},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.07070031762123108}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7466426491737366},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6872144341468811},{"id":"https://openalex.org/C58694771","wikidata":"https://www.wikidata.org/wiki/Q814385","display_name":"Bounded rationality","level":2,"score":0.649349570274353},{"id":"https://openalex.org/C201717286","wikidata":"https://www.wikidata.org/wiki/Q938185","display_name":"Rationality","level":2,"score":0.5414140224456787},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.36508941650390625},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35929808020591736},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35434690117836},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3322077989578247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16080889105796814},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.08360931277275085},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07600095868110657},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.07070031762123108}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-30473-7_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-30473-7_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/6eaca057-9ae6-4175-b288-dc83ef19802e","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/6eaca057-9ae6-4175-b288-dc83ef19802e","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/116962259/Obvious_Strategyproofness_Bounded_Rationality_FERRAIOLI_Accepted1July2019Publishedonline16September2019_GREEN_AAM.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ferraioli , D & Ventre , C 2019 , Obvious Strategyproofness, Bounded Rationality and Approximation : The Case of Machine Scheduling . in D Fotakis & E Markakis (eds) , Algorithmic Game Theory : 12th International Symposium, SAGT 2019, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 11801 LNCS , pp. 77-91 . https://doi.org/10.1007/978-3-030-30473-7_6","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/6eaca057-9ae6-4175-b288-dc83ef19802e","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/6eaca057-9ae6-4175-b288-dc83ef19802e","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/116962259/Obvious_Strategyproofness_Bounded_Rationality_FERRAIOLI_Accepted1July2019Publishedonline16September2019_GREEN_AAM.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ferraioli , D & Ventre , C 2019 , Obvious Strategyproofness, Bounded Rationality and Approximation : The Case of Machine Scheduling . in D Fotakis & E Markakis (eds) , Algorithmic Game Theory : 12th International Symposium, SAGT 2019, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 11801 LNCS , pp. 77-91 . https://doi.org/10.1007/978-3-030-30473-7_6","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320311030","display_name":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","ror":"https://ror.org/01vx64p53"},{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"},{"id":"https://openalex.org/F4320334079","display_name":"Gruppo Nazionale per il Calcolo Scientifico","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3136595833.pdf","grobid_xml":"https://content.openalex.org/works/W3136595833.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1582122708","https://openalex.org/W1646038686","https://openalex.org/W1970647289","https://openalex.org/W1984877922","https://openalex.org/W2057067174","https://openalex.org/W2114249383","https://openalex.org/W2118442327","https://openalex.org/W2126170153","https://openalex.org/W2202514763","https://openalex.org/W2533831074","https://openalex.org/W2583340576","https://openalex.org/W2613412116","https://openalex.org/W2616372367","https://openalex.org/W2675314026","https://openalex.org/W2697907622","https://openalex.org/W2743964280","https://openalex.org/W2778976683","https://openalex.org/W2800693900","https://openalex.org/W2801784094","https://openalex.org/W2887424396","https://openalex.org/W2945290689","https://openalex.org/W2949491553","https://openalex.org/W2951749351","https://openalex.org/W2963156391","https://openalex.org/W2963450685","https://openalex.org/W2977566637","https://openalex.org/W3021035068","https://openalex.org/W3023615263","https://openalex.org/W3136595833"],"related_works":["https://openalex.org/W4388260134","https://openalex.org/W2801172480","https://openalex.org/W2489352369","https://openalex.org/W4297440579","https://openalex.org/W2041473903","https://openalex.org/W187959850","https://openalex.org/W4300099835","https://openalex.org/W4299547270","https://openalex.org/W2358072343","https://openalex.org/W1981486214"],"abstract_inverted_index":{"Obvious":[0],"strategyproofness":[1],"(OSP)":[2],"has":[3],"recently":[4],"emerged":[5],"as":[6],"the":[7,41,44,51,56,63,76,87,95,106,119,146],"solution":[8],"concept":[9],"of":[10,18,24,47,53,55,62,65,78,127,142,148,150],"interest":[11],"to":[12,39,80,129],"study":[13,40,86],"incentive":[14],"compatibility":[15],"in":[16,60,71],"presence":[17],"agents":[19,84],"with":[20],"a":[21,124,140],"specific":[22],"form":[23],"bounded":[25,143],"rationality,":[26],"i.e.,":[27],"those":[28],"who":[29],"have":[30],"no":[31],"contingent":[32],"reasoning":[33],"skill":[34],"whatsoever.":[35],"We":[36,74,100],"here":[37],"want":[38],"relationship":[42],"between":[43,89],"approximation":[45,90],"guarantee":[46],"incentive-compatible":[48],"mechanisms":[49],"and":[50,85,91,116],"degree":[52],"rationality":[54,93,121,144],"agents,":[57],"intuitively":[58],"measured":[59],"terms":[61],"number":[64,126],"contingencies":[66,128],"that":[67,134],"they":[68],"can":[69],"handle":[70],"their":[72],"reasoning.":[73],"weaken":[75],"definition":[77],"OSP":[79,135],"accommodate":[81],"for":[82,94,105,123],"cleverer":[83],"trade-off":[88],"agents\u2019":[92,120],"paradigmatic":[96],"machine":[97,108],"scheduling":[98,109],"problem.":[99],"prove":[101],"that,":[102],"at":[103],"least":[104],"classical":[107],"problem,":[110],"\u201cgood\u201d":[111],"approximations":[112],"are":[113],"possible":[114],"if":[115,118],"only":[117],"allows":[122],"significant":[125],"be":[130],"considered,":[131],"thus":[132],"showing":[133],"is":[136],"not":[137],"too":[138],"restrictive":[139],"notion":[141],"from":[145],"point":[147],"view":[149],"approximation.":[151]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-06-14T07:44:22.658603","created_date":"2025-10-10T00:00:00"}