Short Communication: Optimally Solving the Unit-Demand Envy-Free Pricing Problem with Metric Substitutability in Cubic Time
In general, the unit-demand envy-free pricing problem has proven to be APX-hard, but some special cases can be optimally solved in polynomial time. When substitution costs that form a metric space are included, the problem can be solved in <inline-formula><math xmlns="http://www.w3.org...
| Main Authors: | , , |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
MDPI AG
2021-09-01
|
| 丛编: | Algorithms |
| 主题: | |
| 在线阅读: | https://www.mdpi.com/1999-4893/14/10/279 |