Open AccessThe Complexity of Stable Matchings under Substitutable Preferences
Author(s) -
Yuan Deng,
Debmalya Panigrahi,
Bo Waggoner
Publication year - 2017
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v31i1.10595
Subject(s) - submodular set function , oracle , matching (statistics) , computation , function (biology) , stable marriage problem , set (abstract data type) , computer science , mathematical optimization , preference , mathematics , computational complexity theory , theoretical computer science , algorithm , statistics , software engineering , evolutionary biology , biology , programming language
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom