( en | de | ru )

 

Disambiguation of "Aleksandrov, Martin"

Author of the publication

copydeleteadd this publication to your clipboard
Monotone and Online Fair Division.

, and . KI, volume 11793 of Lecture Notes in Computer Science, page 60-75. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Martin Aleksandrov

Aleksandr Aleksandrov

Krasimir Aleksandrov

Aleksej Aleksandrov

Aleksandar Aleksandrov

 

Other publications of authors with the same name

Online Fair Division: A Survey., and . AAAI, page 13557-13562. AAAI Press, (2020)Fairness for Drivers with Additive Profits in Emerging Vehicle Routing Problems.. AAAI Spring Symposium: HFIF, volume 3276 of CEUR Workshop Proceedings, page 55. CEUR-WS.org, (2022)Efficiency and Truthfulness in Dial-a-Ride Problems with Customers Location Preferences., and . AI, volume 13728 of Lecture Notes in Computer Science, page 690-703. Springer, (2022)Envy Freeness Up to One Item: Shall We Duplicate or Remove Resources?. EPIA, volume 13566 of Lecture Notes in Computer Science, page 727-738. Springer, (2022)Driver Equitability and Customer Optimality in Intelligent Vehicle Applications.. EPIA, volume 13566 of Lecture Notes in Computer Science, page 309-321. Springer, (2022)Fair Division Minimizing Inequality., , and . EPIA (2), volume 11805 of Lecture Notes in Computer Science, page 593-605. Springer, (2019)Safety, Stability, and Efficiency of Taxi Rides., and . EPIA (2), volume 14116 of Lecture Notes in Computer Science, page 401-412. Springer, (2023)Limiting Inequalities in Repeated House and Task Allocation.. AI (2), volume 14472 of Lecture Notes in Computer Science, page 338-349. Springer, (2023)Two Algorithms for Additive and Fair Division of Mixed Manna., and . KI, volume 12325 of Lecture Notes in Computer Science, page 3-17. Springer, (2020)Strategy-Proofness, Envy-Freeness and Pareto Efficiency in Online Fair Division with Additive Utilities., and . PRICAI (1), volume 11670 of Lecture Notes in Computer Science, page 527-541. Springer, (2019)