{"title":"基于公平的用户中心网络全局优化","authors":"M. Köppen, Kaori Yoshida, M. Tsuru, Y. Oie","doi":"10.1109/NCM.2009.219","DOIUrl":null,"url":null,"abstract":"In this paper, we discuss the opportunities for global optimization of networks, which takes the user perspective into account. We state three fundamental problems in this approach, which are the variable (and usually also large) number of objectives, the Arrow impossibility theorem, and the unavoidance of the fact that the feasible space may contain solutions, where some objectives are extreme. To overcome these problems, we propose to achieve at least fairness among the fulfillment of user objectives, if optimality (e.g. in the sense of Pareto-optimality) is not possible. We also outline a generalized approach to fairness, based on fairness relation. Heuristic methods are available to handle the corresponding search problems.","PeriodicalId":119669,"journal":{"name":"2009 Fifth International Joint Conference on INC, IMS and IDC","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Fairness-Based Global Optimization of User-Centric Networks\",\"authors\":\"M. Köppen, Kaori Yoshida, M. Tsuru, Y. Oie\",\"doi\":\"10.1109/NCM.2009.219\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we discuss the opportunities for global optimization of networks, which takes the user perspective into account. We state three fundamental problems in this approach, which are the variable (and usually also large) number of objectives, the Arrow impossibility theorem, and the unavoidance of the fact that the feasible space may contain solutions, where some objectives are extreme. To overcome these problems, we propose to achieve at least fairness among the fulfillment of user objectives, if optimality (e.g. in the sense of Pareto-optimality) is not possible. We also outline a generalized approach to fairness, based on fairness relation. Heuristic methods are available to handle the corresponding search problems.\",\"PeriodicalId\":119669,\"journal\":{\"name\":\"2009 Fifth International Joint Conference on INC, IMS and IDC\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fifth International Joint Conference on INC, IMS and IDC\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCM.2009.219\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth International Joint Conference on INC, IMS and IDC","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCM.2009.219","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fairness-Based Global Optimization of User-Centric Networks
In this paper, we discuss the opportunities for global optimization of networks, which takes the user perspective into account. We state three fundamental problems in this approach, which are the variable (and usually also large) number of objectives, the Arrow impossibility theorem, and the unavoidance of the fact that the feasible space may contain solutions, where some objectives are extreme. To overcome these problems, we propose to achieve at least fairness among the fulfillment of user objectives, if optimality (e.g. in the sense of Pareto-optimality) is not possible. We also outline a generalized approach to fairness, based on fairness relation. Heuristic methods are available to handle the corresponding search problems.