Classic cake cutting protocols — which fairly allocate a divisible good among agents with heterogeneous preferences — are susceptible to manipulation. Do their strategic outcomes still guarantee fairness? We model the interaction among agents as a game and study its Nash equilibria. We show that each protocol in the novel class of generalized cut and choose protocols — which includes the most i...

This paper first presents a parallel solution for the Flowshop Scheduling Problem in parallel environment, and then proposes a novel load balancing strategy. The proposed Proportional Fairness Strategy (PFS) takes computational performance of computing process sets into account, and assigns additional load to computing nodes proportionally to their evaluated performance. In order to efficiently...

In this paper, a proportional fairness scheduling for the non-realtime service in high speed data transmission systems is proposed. For a forward link scheduler even in CDMA systems, it is shown that the time division through rate control provides better performance than code division through power control [3]. Our proportionally fair scheme is based on the average requested rate, requested rat...

In this paper, a cooperative relaying system with α-proportional fair scheduling is proposed for multi-carrier systems. The cooperative relaying provides ’virtual’ MIMO through combining the signals from the source and the relay at the destination in addition to the advantage of the simple relaying which reduces path-loss attenuation in the air interface. We have adopted the α-proportional fair...

This letter proposes a control theoretic approach to achieve proportional fairness amongst access categories (ACs) in an error-prone EDCA WLAN for provision of distinct QoS requirements and priority parameters. The approach adaptively adjusts the minimum contention window of each AC to derive the station attempt probability to its optimum which leads to a proportional fair allocation of station...

In this paper, we propose the new proportional fair (PF) scheduling algorithm for the uplink MIMO-OFDM systems. The proposed PF scheduling algorithm selects users based on the channel matrix to allocate spatial channels in a subband. Simulation results show that the proposed PF scheduling algorithm achieves better fairness and higher throughput than conventional scheduling algorithms. Index Ter...

With virtual machines (VM), we design a cloud system aiming to optimize the overall performance, in processing user requests made up of composite services. We address three contributions. (1) We optimize VM resource allocation with a minimized processing overhead subject to task’s payment budget. (2) For maximizing the fairness of treatment in a competitive situation, we investigate the best-su...

We study the paradigmatic fair division problem of fairly allocating a divisible good among agents with heterogeneous preferences, commonly known as cake cutting. Classic cake cutting protocols are susceptible to manipulation. Do their strategic outcomes still guarantee fairness? To address this question we adopt a novel algorithmic approach, proposing a concrete computational model and reasoni...