Preference Based Fair Allocation of Limitted Resources
type: CreativeWork
description: The fair division of scarce resources among agents is a challenging issue across a range of applications, especially when there is competition among agents. One application of resource division is in Air Traffic Management (ATM). This dissertation is motivated by the fairness issues that arise in the resource allocation procedures that have been introduced under Collaborative Decision Making (CDM). Fair rationing and allocation of available en-route time slots are two major challenges that we address in this research. The first challenge, fair rationing, is about how to compute a fair share of available resources among agents, when the available resources fall below the total demand. Since the demand, (flights), are time dependent, we introduce a new rationing method that includes the time dependency of demand. The new procedure gives every flight that is disrupted by an AFP a share of available resources. This is in contrast to Ration-By-Schedule (RBS), the allocation method currently in use, where later scheduled flights do not receive any slots. We will discuss and prove the fairness properties of our novel rationing procedure. The second challenge, allocation of en-route resources, is about how to allocate resources among competitive agents, (flight operators), when each agent has different preferences over resources, (time slots). We design four randomized procedures for allocating scarce resources when the airlines' preferences are included. These procedures use an exogenous fair share, which can be computed using the method described above, as a fairness standard for the allocation of slots among airlines. The first two procedures, Preference Based Proportional Random Allocation (PBPRA) and Modified-PBPRA, implicity assume equal weight for each time slot. Compared to RBS, PBPRA and M-PBPRA reduce the total internal cost of airlines and also assign each airline a number of slots close (in expectation) to their fair share. The fairness, efficiency and incentive…
abstract: The fair division of scarce resources among agents is a challenging issue across a range of applications, especially when there is competition among agents. One application of resource division is in Air Traffic Management (ATM). This dissertation is motivated by the fairness issues that arise in the resource allocation procedures that have been introduced under Collaborative Decision Making (CDM). Fair rationing and allocation of available en-route time slots are two major challenges that we address in this research. The first challenge, fair rationing, is about how to compute a fair share of available resources among agents, when the available resources fall below the total demand. Since the demand, (flights), are time dependent, we introduce a new rationing method that includes the time dependency of demand. The new procedure gives every flight that is disrupted by an AFP a share of available resources. This is in contrast to Ration-By-Schedule (RBS), the allocation method currently in use, where later scheduled flights do not receive any slots. We will discuss and prove the fairness properties of our novel rationing procedure. The second challenge, allocation of en-route resources, is about how to allocate resources among competitive agents, (flight operators), when each agent has different preferences over resources, (time slots). We design four randomized procedures for allocating scarce resources when the airlines' preferences are included. These procedures use an exogenous fair share, which can be computed using the method described above, as a fairness standard for the allocation of slots among airlines. The first two procedures, Preference Based Proportional Random Allocation (PBPRA) and Modified-PBPRA, implicity assume equal weight for each time slot. Compared to RBS, PBPRA and M-PBPRA reduce the total internal cost of airlines and also assign each airline a number of slots close (in expectation) to their fair share. The fairness, efficiency and incentive…
author: Vakili Pourtaklo, Nasim
date published: 2009
date modified: 2026-07-24T03:02:13Z
provider: University of Maryland
publisher: Networked Digital Library of Theses and Dissertations
type: WebPage
source organization: University of Maryland

PropertyValue
property ID: Handle
value: http://hdl.handle.net/1903/10749