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...

Multiuser orthogonal frequency division multiplexing (MU-OFDM) is a promising technique for achieving high downlink capacities in future cellular systems. A key issue in MU-OFDM is the allocation of the OFDM subcarriers and power among users sharing the channel. Previous allocation algorithms cannot ensure fairness in advance. In this paper, a proportional rate adaptive resource allocation meth...

The focus of this paper is to compare two popular congestion control algorithms: AIMD (additive increase/multiplicative decrease) and AIPD (additive increase/loss proportional decrease). The key contributions of the paper are two-fold: (a) we first clarify the definitions of AIMD and AIPD congestion control algorithms, and compare them in various aspects: convergence characteristics, steady sta...

This paper describes a forward link multi carrier packet scheduler method for a high-speed packet data communication system. A proportional fairness method has been proposed to realize high data throughput. This paper proposes a modification to the proportional fairness method to add multi carrier capability for the improvement of data throughput. In the proposal, an access terminal with capabi...

Recently IEEE 802.16 WiMAX has attracted a lot of attention in wireless networking research and applications. An attempt had been made to compare DropTail, RED, Proportional fairness and DRR protocol model of WiMAX Point to Multi-Point mode with the focus on entry process and scheduling. DropTail queue similar to a First in First out (FIFO) queue drops tailing-after packets when the queue is fu...

In this document we study the application of weighted proportional fairness to data ows in the Internet. We let the users set the weights of their connections in order to maximise the utility they get from the network. When combined with a pricing scheme where connections are billed by weight and time, such a system is known to maximise the total utility of the network. Our study case is a nati...

In this contribution we give a general de nition of fairness and show how this can achieve various fairness de nitions such as those mentioned in the ATM Forum TM Speci cations We discuss how a pricing policy can be mapped to general fairness The general fairness can be achieved by calculating the ExcessFairshare for each VC We show how a switch algorithm can be modi ed to support the general f...

Are fairness concerns of relevance to environmental economics and, if so, are they sufficiently structured to improve analysis in this field? On both of these questions, we answer in the affirmative, arguing that people’s fairness views are based on both general rules and the context, where context refers to the set of variables and persons employed to interpret and apply the principles. The fa...

We aim at assigning bandwidth fairly to calls that have minimum bandwidth requirements. Our goal is to provide a general computational tool based on Semi-Definite Programming (SDP). The advantage of our approach is that many appealing complex objective functions related to fairness criteria are special cases of our formalism. Therefore, such optimization problems can be solved in an automatic m...