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/1998/Math/Mat...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
MDPI AG
2021-09-01
|
| Serier: | Algorithms |
| Fag: | |
| Online adgang: | https://www.mdpi.com/1999-4893/14/10/279 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|