Efficient Algorithms for Several Constrained Resource Allocation, Management and Discovery Problems
Mugurel Ionut Andreica, Madalina Ecaterina Andreica, Daniel Ardelean

TL;DR
This paper introduces efficient algorithms for various resource allocation, management, and discovery problems, utilizing new geometric techniques and models for constrained resources in multidimensional spaces and a game-theoretic approach for discovery.
Contribution
It presents novel algorithms and geometric methods for constrained resource problems and introduces a game-theoretic model for resource discovery.
Findings
New geometric techniques for resource allocation in multidimensional spaces
Efficient algorithms for constrained resource management problems
A game-theoretic model for resource discovery
Abstract
In this paper we present efficient algorithmic solutions for several constrained resource allocation, management and discovery problems. We consider new types of resource allocation models and constraints, and we present new geometric techniques which are useful when the resources are mapped to points into a multidimensional feature space. We also consider a resource discovery problem for which we present a guessing game theoretical model.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Constraint Satisfaction and Optimization · Data Management and Algorithms
