The Third International Workshop on Computational Social Choice Düsseldorf, Germany, September 13–16, 2010, looks to have been a very interesting event, and it included a number of papers related to matching:
Where are the Hard Manipulation Problems? Toby Walsh
Allocation via Deferred-Acceptance under Responsive Priorities Lars Ehlers and Bettina Klaus
Fractional Solutions for NTU-Games Péter Biró and Tamás Fleiner
Algorithms for Pareto Stable Assignment Ning Chen and Arpita Ghosh
Stable Marriage Problems with Quantitative Preferences Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, and Toby Walsh
Local Search for Stable Marriage Problems Mirco Gelain, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, and Toby Walsh
HT: Bettina Klaus
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.