z-logo
open-access-imgOpen Access
Algorithms for Max-Min Share Fair Allocation of Indivisible Chores
Author(s) -
Haris Aziz,
Gerhard Rauchecker,
Guido Schryen,
Toby Walsh
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.10582
Subject(s) - computer science , scheme (mathematics) , scheduling (production processes) , heuristic , fair share , max min fairness , mathematical optimization , time complexity , polynomial , resource allocation , mathematics , algorithm , artificial intelligence , economics , computer network , mathematical analysis , law and economics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom