An Efficient Algorithm for the Discrete Assignment Problem with Non-Quasilinear Preferences over Item Qualities and Money

Le résumé fourni par la source

An algorithm which computes precise minimum price equilibrium prices and assignments where we have a set of items to assign to agents, unit demand for those items, and arbitrary preferences over item qualities and money. This algorithm can solve in average polynomial time complexity when quite general restrictions on preferences are imposed. This means that the algorithm is capable of solving for equilibrium prices and assignments in markets with non-quasilinear preferences and thousands of items/agents, in reasonable time.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.