Abstract
In this paper "The Fair Acceptance & Optimized Allocation" algorithm will be explained which can be applied to the cases with quantitative categories of data and the optimized allocation of a predefined scope to those categories of data. This algorithm can be widely applied in situations which involve making decisions for the optimized and most fair case of allocating resources to the consumers. Optimized and fair allocation of a virtual space to its users or optimized and fair allocation of a physical and real space to its owners, are among cases which can be solved by this algorithm. Allocating a parking lot area to a number of vehicles with different sizes and specified numbers for each size would be an applicable example of such algorithm.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2008 International Conference on Information and Knowledge Engineering, IKE 2008 |
| Pages | 211-216 |
| Number of pages | 6 |
| Publication status | Published - 2008 |
| Event | 2008 International Conference on Information and Knowledge Engineering - Las Vegas, NV, United States Duration: 14 Jul 2008 → 17 Jul 2008 |
Conference
| Conference | 2008 International Conference on Information and Knowledge Engineering |
|---|---|
| Abbreviated title | IKE 2008 |
| Country/Territory | United States |
| City | Las Vegas, NV |
| Period | 14/07/08 → 17/07/08 |
Keywords
- Fair acceptance
- Optimized allocation
- Optimized path
- Path sharing
- Remained areas