{"id":"https://openalex.org/W2150170179","doi":null,"title":"Learning Near-Pareto-Optimal Conventions in Polynomial Time","display_name":"Learning Near-Pareto-Optimal Conventions in Polynomial Time","alternate_titles":[],"publication_year":2003,"publication_date":"2003-12-09","ids":{"openalex":"https://openalex.org/W2150170179","mag":"2150170179"},"language":"en","primary_location":{"id":"mag:2150170179","doi":null,"is_oa":false,"landing_page_url":"https://papers.nips.cc/paper/2390-learning-near-pareto-optimal-conventions-in-polynomial-time.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4363606243","display_name":"neural information processing systems","issn_l":"1049-5258","issn":["1049-5258"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":"https://openalex.org/P4404678063","host_organization_name":"Neural Information Processing Systems Foundation","host_organization_lineage":["https://openalex.org/P4404678063"],"host_organization_lineage_names":["Neural Information Processing Systems Foundation"],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Neural Information Processing Systems","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2150170179"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5100333239","display_name":"Xiaofeng Wang","orcid":"https://orcid.org/0000-0002-0607-4946","observed_orcids":["https://orcid.org/0000-0002-0607-4946"]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Xiaofeng Wang","raw_affiliation_strings":["ECE Dept., Carnegie Mellon Univ., Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE Dept., Carnegie Mellon Univ., Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023571961","display_name":"T\u00fcomas Sandholm","orcid":"https://orcid.org/0000-0001-8861-9366","observed_orcids":["https://orcid.org/0000-0001-8861-9366"]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"T\u00fcomas Sandholm","raw_affiliation_strings":["CS Department, Carnegie Mellon University, Pittsburgh, PA#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-8861-9366","affiliations":[{"raw_affiliation_string":"CS Department, Carnegie Mellon University, Pittsburgh, PA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.6655,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.82446185,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":95},"biblio":{"volume":"16","issue":null,"first_page":"863","last_page":"870"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9976000189781189,"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/T11031","display_name":"Game Theory and Applications","score":0.9976000189781189,"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.0005000000237487257,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.00039999998989515007,"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/repeated-games","display_name":"repeated games","score":0.47099998593330383},{"id":"https://openalex.org/keywords/coordination-games","display_name":"coordination games","score":0.6639999747276306},{"id":"https://openalex.org/keywords/multiple-equilibria","display_name":"multiple equilibria","score":0.8019999861717224},{"id":"https://openalex.org/keywords/equilibrium-selection","display_name":"equilibrium selection","score":0.5789999961853027},{"id":"https://openalex.org/keywords/imperfect-monitoring","display_name":"imperfect monitoring","score":0.578000009059906},{"id":"https://openalex.org/keywords/perfect-monitoring","display_name":"perfect monitoring","score":0.9010000228881836},{"id":"https://openalex.org/keywords/learning-algorithms","display_name":"learning algorithms","score":0.5609999895095825},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.7120000123977661}],"concepts":[{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.7362508177757263},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.707776665687561},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6173713803291321},{"id":"https://openalex.org/C2780310539","wikidata":"https://www.wikidata.org/wiki/Q12547192","display_name":"Imperfect","level":2,"score":0.6141542792320251},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.6027509570121765},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.5859033465385437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5603259801864624},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.5156408548355103},{"id":"https://openalex.org/C107257861","wikidata":"https://www.wikidata.org/wiki/Q656316","display_name":"Coordination game","level":2,"score":0.4900931119918823},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4787706434726715},{"id":"https://openalex.org/C123676819","wikidata":"https://www.wikidata.org/wiki/Q1074338","display_name":"Perfect information","level":2,"score":0.4635241627693176},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.4258931875228882},{"id":"https://openalex.org/C164407509","wikidata":"https://www.wikidata.org/wiki/Q5384490","display_name":"Equilibrium selection","level":4,"score":0.42442458868026733},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.37196433544158936},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27483445405960083},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"mag:2150170179","doi":null,"is_oa":false,"landing_page_url":"https://papers.nips.cc/paper/2390-learning-near-pareto-optimal-conventions-in-polynomial-time.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4363606243","display_name":"neural information processing systems","issn_l":"1049-5258","issn":["1049-5258"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":"https://openalex.org/P4404678063","host_organization_name":"Neural Information Processing Systems Foundation","host_organization_lineage":["https://openalex.org/P4404678063"],"host_organization_lineage_names":["Neural Information Processing Systems Foundation"],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Neural Information Processing Systems","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.2.5258","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.5258","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-2.cs.cmu.edu/~sandholm/learning.nips03.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.420.8344","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.420.8344","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://books.nips.cc/papers/files/nips16/preproc/NIPS2003_CN15.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.67.7909","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.7909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://books.nips.cc/papers/files/nips16/NIPS2003_CN15.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.3521","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.3521","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://books.nips.cc/papers/files/nips16/NIPS2003_CN15.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.963.7650","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.963.7650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://papers.nips.cc/paper/2390-learning-near-pareto-optimal-conventions-in-polynomial-time.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1505937442","https://openalex.org/W1513468570","https://openalex.org/W1519783625","https://openalex.org/W1521003796","https://openalex.org/W1605188341","https://openalex.org/W1884189620","https://openalex.org/W1973039793","https://openalex.org/W1991548885","https://openalex.org/W2052267638","https://openalex.org/W2083143894","https://openalex.org/W2104602264","https://openalex.org/W2107726111","https://openalex.org/W2118994458","https://openalex.org/W2136697899","https://openalex.org/W2145067550","https://openalex.org/W2164637474","https://openalex.org/W2489939061","https://openalex.org/W3023407077"],"related_works":["https://openalex.org/W7099859565","https://openalex.org/W2012347046","https://openalex.org/W7098991383","https://openalex.org/W7097775621","https://openalex.org/W7133199296","https://openalex.org/W7099299652","https://openalex.org/W7061641503","https://openalex.org/W8572852","https://openalex.org/W1587652772"],"abstract_inverted_index":{"We":[0,26,49],"study":[1],"how":[2],"to":[3,5],"learn":[4],"play":[6],"a":[7],"Pareto-optimal":[8],"strict":[9],"Nash":[10],"equilibrium":[11],"when":[12],"there":[13],"exist":[14],"multiple":[15],"equilibria":[16],"and":[17,45,59,71],"agents":[18,36,65],"may":[19],"have":[20],"different":[21],"pref-erences":[22],"among":[23],"the":[24,40,56,60,64,72],"equilibria.":[25],"focus":[27],"on":[28],"repeated":[29],"coordination":[30],"games":[31],"of":[32],"non-identical":[33],"interest":[34],"where":[35],"do":[37],"not":[38],"know":[39],"game":[41],"structure":[42],"up":[43],"front":[44],"receive":[46],"noisy":[47],"payoffs.":[48],"design":[50],"efficient":[51],"near-optimal":[52],"al-gorithms":[53],"for":[54],"both":[55],"perfect":[57],"monitoring":[58,62],"imperfect":[61],"setting(where":[63],"only":[66],"observe":[67],"their":[68],"own":[69],"payoffs":[70],"joint":[73],"actions).":[74],"1":[75]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2150170179","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
