Regresar

RAPL: A Domain Specific Language for Resource Allocation of Indivisible Goods

Abstract:

We propose a new Domain Specific Language (DSL) to represent and solve resource allocation problems of indivisible goods. Resource allocation problems can be represented using matrices; this representation is flexible and has interesting mathematical properties that the solution can exploit. However, the programming of such a problem using a general-purpose programming language might include an unnecessary level of complexity. This new DSL allows the user to declare the agents and their preferences of resources. Also, the language can manipulate those elements with the proper operations involved in the resource allocation problem. The proposed DSL can measure efficiency criteria such as Pareto optimality, measure fairness criteria such as Envy-free, and represent results using matrices. This work shows the structure of the interpreter of this language and provides details about the scanner, parser, and interpreter for this language. This DSL will be called Resource Allocation Programming Language (RAPL). We hope that the easiness of use of this DSL can motivate further research on this topic.