|
|
|
|
|
Marcos M. Salvatierra, Mario Salvatierra, Jr. and Juan G. Colonna
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 O(n4)" role="p...
ver más
|
|
|
|
|