A complexity approach for core-selecting exchange under conditionally lexicographic preferences

DOI10.1613/JAIR.1.11254MaRDI QIDQ4558795zbMATH OpenOpenAlexWikidataFDO

Authors Etsushi Fujita, Julien Lesca, Akihisa Sonoda, Taiki Todo, Makoto Yokoo

Publication date 30 November 2018

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.1.11254

zbMATH Keywords

resource allocationlexicographic preferencesmechanism designaugmented top-trading-cyclescore-selecting exchange

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Mechanism design theory (91B03)

Recommendations

• Some characterizations of generalized top trading cycles
• Strategic Manipulation in a Society with Indivisible Goods
• Exchange in a general market with indivisible goods
• Strategy-proof exchange under trichotomous preferences
• Strategyproof exchange of indivisible goods.

Cited in

(9)

• Group incentive compatibility in the housing market problem with weak preferences
• Pareto optimal matchings with lower quotas
• Reallocation mechanisms under distributional constraints in the full preference domain
• scientific article; zbMATH DE number 7450024 (Why is no real title available?)
• A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences
• Strategyproof allocation mechanisms with endowments and M-convex distributional constraints
• Pareto optimal matchings in many-to-many markets with ties
• Stable allocations in discrete exchange economies
• Pareto optimal matchings in many-to-many markets with ties

This page was built for publication: A complexity approach for core-selecting exchange under conditionally lexicographic preferences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558795)