| 2009 |
|---|
| 15 | EE | Xi Chen,
Li-Sha Huang,
Shang-Hua Teng:
Market equilibria with hybrid linear-Leontief utilities.
Theor. Comput. Sci. 410(17): 1573-1580 (2009) |
| 2008 |
|---|
| 14 | EE | Li-Sha Huang:
CPU Time Pricing.
Encyclopedia of Algorithms 2008 |
| 13 | EE | Li-Sha Huang:
General Equilibrium.
Encyclopedia of Algorithms 2008 |
| 12 | EE | Li-Sha Huang:
A Primal-Dual Algorithm for the Computation of Market Equilibrium with Logarithmic Utility Functions.
Algorithmica 51(3): 357-366 (2008) |
| 2007 |
|---|
| 11 | EE | Li-Sha Huang,
Shang-Hua Teng:
On the Approximation and Smoothed Complexity of Leontief Market Equilibria.
FAW 2007: 96-107 |
| 10 | EE | Xiaotie Deng,
Li-Sha Huang,
Minming Li:
On Walrasian Price of CPU Time.
Algorithmica 48(2): 159-172 (2007) |
| 2006 |
|---|
| 9 | EE | Xi Chen,
Li-Sha Huang,
Shang-Hua Teng:
Market Equilibria with Hybrid Linear-Leontief Utilities.
WINE 2006: 274-285 |
| 8 | EE | Li-Sha Huang,
Shang-Hua Teng:
On the Approximation and Smoothed Complexity of Leontief Market Equilibria
CoRR abs/cs/0602090: (2006) |
| 7 | EE | Li-Sha Huang,
Shang-Hua Teng:
On the Approximation and Smoothed Complexity of Leontief Market Equilibria.
Electronic Colloquium on Computational Complexity (ECCC) 13(031): (2006) |
| 6 | EE | Xiaotie Deng,
Li-Sha Huang:
On the complexity of market equilibria with maximum social welfare.
Inf. Process. Lett. 97(1): 4-11 (2006) |
| 2005 |
|---|
| 5 | EE | Xiaotie Deng,
Li-Sha Huang,
Minming Li:
On Walrasian Price of CPU Time.
COCOON 2005: 586-595 |
| 4 | EE | Li-Sha Huang:
A Practical Algorithm for the Computation of Market Equilibrium with Logarithmic Utility Functions.
ISAAC 2005: 463-472 |
| 3 | EE | Li-Sha Huang:
A Fixed Point Approach for the Computation of Market Equilibria.
WINE 2005: 1013-1022 |
| 2 | EE | Li-Sha Huang,
Xiaotie Deng:
On Complexity of Market Equilibria with Maximum Social Welfare
Electronic Colloquium on Computational Complexity (ECCC)(074): (2005) |
| 1 | EE | Li-Sha Huang,
Minming Li,
Bo Zhang:
Approximation of Walrasian equilibrium in single-minded auctions.
Theor. Comput. Sci. 337(1-3): 390-398 (2005) |
