Please use this identifier to cite or link to this item:
http://dspace.cityu.edu.hk/handle/2031/8709
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yuan, Hongning | en_US |
dc.date.accessioned | 2017-03-08T06:22:15Z | |
dc.date.accessioned | 2017-09-19T08:51:11Z | |
dc.date.accessioned | 2019-02-12T06:53:23Z | - |
dc.date.available | 2017-03-08T06:22:15Z | |
dc.date.available | 2017-09-19T08:51:11Z | |
dc.date.available | 2019-02-12T06:53:23Z | - |
dc.date.issued | 2016 | en_US |
dc.identifier.other | 2016csyhn532 | en_US |
dc.identifier.uri | http://144.214.8.231/handle/2031/8709 | - |
dc.description.abstract | The classic facility location game models the scenario where the government plans to build some public facilities like supermarkets, movie theaters and base stations on a street where some self-interested residents are situated. The residents are required to report their information like locations and preferences to the government, which will then be mapped to the building locations of the facilities by some mechanisms. In this research, a new model of the facility location game, the optional preference model is proposed and studied. Unlike the classic preference model, agents in this model are allowed to have optional preference, which gives them more flexibility when reporting. The creativity in the optional preference model is that if an agent only cares one of the several similar facilities, e.g. the closest one (The Min variant), or the most far away one (The Max variant), she can report her preference precisely and this will be taken into consideration, which is not possible in the classic preference models studied before. With the objective of minimizing the highest(maximum) or the sum(social) of all agents' cost, corresponding strategyproof mechanisms are proposed, which means no agents can benefit, e.g. reducing her cost, by lying to these mechanisms. For the Min variant, a 2-approximation mechanism as well as a lower bound of 4/3 are proposed for the maximum cost objective. And a (1+n/2)-approximation mechanism as well as a lower bound of 2 are proposed for the social cost objective. Lower bound means that no strategyproof mechanism can have a better approximation ratio than this bound. For the Max variant, an optimal mechanism is proposed for the maximum cost objective and a 2-approximation mechanism for the social cost objective. The significance of this new preference model, apart from its real life applications, is that it enriched the types of preference and the cost functions of agents and opened up a new direction for researchers to work along. Also, with the results obtained for the two variants, it can serve as the potential building blocks for more general functions. | en_US |
dc.rights | This work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner. | en_US |
dc.rights | Access is restricted to CityU users. | en_US |
dc.title | Facility Location Games with Optional Preference | en_US |
dc.contributor.department | Department of Computer Science | en_US |
dc.description.supervisor | Supervisor: Dr. Li, Minming; First Reader: Dr. Li, Shuaicheng; Second Reader: Prof. Wang, Jun | en_US |
Appears in Collections: | Computer Science - Undergraduate Final Year Projects |
Files in This Item:
File | Size | Format | |
---|---|---|---|
fulltext.html | 146 B | HTML | View/Open |
Items in Digital CityU Collections are protected by copyright, with all rights reserved, unless otherwise indicated.