A computer-implemented method, the method comprising: (a) generating, by at least a processor, a data structure comprising a set of vectors corresponding to a plurality of tenants to be allocated to a plurality of platform resources that are network-accessible, wherein each vector is multi-dimensional and includes values indicating demand for a platform resource of the platform resources by a respective tenant, wherein each dimension of each vector represents a unit time; (b) determining, by at least the processor, a target vector for allocating a portion of the plurality of tenants to a first platform resource included among the platform resources, the target vector establishing a desired value of a sum of vectors corresponding to the plurality of tenants allocated to the first platform resource, wherein the portion of the plurality of tenants is generated by receiving values of the resource demand from a specific tenant during dimensions that correspond to a defined time increment; (c) identifying, by at least the processor, a first vector included in the set of vectors that minimizes a Euclidean norm of a difference between the target vector and the vector of the set of vectors; (d) allocating, by at least the processor, a tenant corresponding to the first vector to the first platform resource as a result of the first vector being identified; (f) analyzing, by at least the processor, the set of vectors to determine whether a second vector that minimizes a Euclidean norm of a difference between: (i) the target vector, and (ii) a combination of the first vector and the second vector exists; (g) as a result of determining that the second vector exists, allocating, by at least the processor, a tenant corresponding to the second vector to the first platform resource; and (h) as a result of determining that the second vector does not exist, recalculating the target vector without taking into consideration the first vector and the second vector, and repeating steps (c) to (h). (a) generating, by at least a processor, a data structure comprising a set of vectors corresponding to a plurality of tenants to be allocated to a plurality of platform resources that are network-accessible, wherein each vector is multi-dimensional and includes values indicating demand for a platform resource of the platform resources by a respective tenant, wherein each dimension of each vector represents a unit time; (b) determining, by at least the processor, a target vector for allocating a portion of the plurality of tenants to a first platform resource included among the platform resources, the target vector establishing a desired value of a sum of vectors corresponding to the plurality of tenants allocated to the first platform resource, wherein the portion of the plurality of tenants is generated by receiving values of the resource demand from a specific tenant during dimensions that correspond to a defined time increment; (c) identifying, by at least the processor, a first vector included in the set of vectors that minimizes a Euclidean norm of a difference between the target vector and the vector of the set of vectors; (d) allocating, by at least the processor, a tenant corresponding to the first vector to the first platform resource as a result of the first vector being identified; (f) analyzing, by at least the processor, the set of vectors to determine whether a second vector that minimizes a Euclidean norm of a difference between: (i) the target vector, and (ii) a combination of the first vector and the second vector exists; (g) as a result of determining that the second vector exists, allocating, by at least the processor, a tenant corresponding to the second vector to the first platform resource; and (h) as a result of determining that the second vector does not exist, recalculating the target vector without taking into consideration the first vector and the second vector, and repeating steps (c) to (h). recalculating the target vector without taking into consideration the first vector and the second vector, and repeating steps (c) to (h).