In the foregoing chapterComputational fairness, we have extensively studied a single and rather simple example of an allocation problem. We have seen a number of ways to specify Optimality“optimality” in order to solicit a single solution among all feasible allocations. It was also observed that some relations appeared between these different ways and their solutions, leading to multiple appearances of the same solutions. But we haven’t seen much about generality.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Computational Fairness in Resource-Sharing

  • Mario Köppen,
  • Masato Uchida,
  • Masato Tsuru,
  • Włodzimierz Ogryczak,
  • Siddhartha Bhattacharyya

摘要

In the foregoing chapterComputational fairness, we have extensively studied a single and rather simple example of an allocation problem. We have seen a number of ways to specify Optimality“optimality” in order to solicit a single solution among all feasible allocations. It was also observed that some relations appeared between these different ways and their solutions, leading to multiple appearances of the same solutions. But we haven’t seen much about generality.