The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Fairness models can be roughly categorized into two groups: proportional fairness based models balancing the relative values of allocated goods, and maxmin fairness based models with reference to absolute valuations. In a specific problem domain it appears that only one fairness model can be used. Here a situation is studied where the users of a wireless infrastructure have in fact conflicting interests...
This paper examines our previously proposed mutation-based search method for temporary information sharing in a wireless mesh network. The temporary information sharing indicates that for the case in which information senders and receivers freely appear in the network, information is forwarded from an information sender to a receiver. The mutation-based search method determines a unique route to find...
Many network control policies can benefit from introducing priorities among users, traffic flows, or service provisions e.g. For QoS improvement or network congestion avoidance. In order to ensure fairness of concomitant resource sharing tasks, generic extensions of maxmin fairness under priority are considered. A critical analysis of existing approaches leads to the definition of two fairness relations...
A human-based genetic algorithm (HBGA) is one type of genetic algorithms, in which humans conduct all genetic operators such as selection, crossover, and mutation in a way such that they select others' solution candidates (selection) and create new candidate solutions influenced by the selected ones (crossover and mutation). HBGA needs a way for people to share their candidate solutions. One way is...
We present a benchmark for the performance evaluation of heuristic and meta-heuristic approaches to fair distribution of indivisible goods. The specific problem reflected by the benchmark data sets is Wireless Channel Allocation (WCA), and the approach to fair distribution is to choose from feasible allocations by the maximum set of a fairness relation between their corresponding allocation performances...
We present the results of a comparative study on the design of meta-heuristic algorithms for achieving parabolic fairness in wireless channel allocation. Wireless channel allocation (WCA) is a basic problem of fair distribution of indivisible goods, in this case the allocation of channels to users in a wireless schedule. Parabolic fairness represents a state that coincides with maxmin fairness in...
In this paper we provide an extension of maxmin fairness to the case of multiple objectives and different agent preferences by the definition of the maxmin multi-fairness relation. This generic relation is based on a formal modification of maxmin fairness according to its implicit comparisons and includes maxmin fairness as a special case. The application of this multi-fairness relation to a selfish,...
We consider the meta-heuristic approach to optimization as to be performed in four stages (model, optimality, algorithm, verification), and point out the potential of varying the optimality stage, in contrary to the design of new algorithms. Thus, we can also apply the meta-heuristic approach to optimization to the task of fair distribution of indivisible or elastic goods, where the optimality is...
Maxmin fairness can be characterized as a state obtained from the application of the bottleneck flow control algorithm, allowing for a formally efficient definition of a fairness concept. But a number of problems with the related maxmin fairness vector relation, esp. non-uniqueness of the maximum, preference for improving least components, artefacts appearing in the discrete domain, and lack of numerical...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.