Ning Chen

Shengyu Zhang

Encyclopedia of Algorithms, 2016

On revenue maximization with sharp multi-unit demands.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Incentives for Strategic Behavior in Fisher Market Games.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Dynamics of Profit-Sharing Games.

[BibT_eX]

[DOI]

Internet Math., 2015

Competitive Analysis via Benchmark Decomposition.

[BibT_eX]

[DOI]

Nikolai Gravin

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Solving Linear Programming with Constraints Unknown.

[BibT_eX]

[DOI]

Xiaohui Bei

Shengyu Zhang

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Envy-free pricing in multi-item markets.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

Truthful Generalized Assignments via Stable Matching.

[BibT_eX]

[DOI]

Math. Oper. Res., 2014

Auctions for social lending: A theoretical analysis.

[BibT_eX]

[DOI]

Nicolas S. Lambert

Games Econ. Behav., 2014

Optimal competitive auctions.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

2013

Improved Approximation Algorithms for the Spanning Star Forest Problem.

[BibT_eX]

[DOI]

Algorithmica, 2013

Trial and error in influential social networks.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

2012

On the Complexity of Trial and Error.

[BibT_eX]

[DOI]

Xiaohui Bei

Shengyu Zhang

Electron. Colloquium Comput. Complex., 2012

Budget feasible mechanism design: from prior-free to bayesian.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Incentive Ratios of Fisher Markets.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Computing the Nucleolus of Matching, Cover and Clique Games.

[BibT_eX]

[DOI]

Hongyang Zhang

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Optimal Proportional Cake Cutting with Connected Pieces.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Optimal Envy-Free Pricing with Metric Substitutability.

[BibT_eX]

[DOI]

Sergei Vassilvitskii

SIAM J. Comput., 2011

A note on <i>k</i>-shortest paths problem.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Budget Feasible Mechanism Design via Random Sampling

[BibT_eX]

[DOI]

CoRR, 2011

Mechanism Design without Money via Stable Matching

[BibT_eX]

[DOI]

CoRR, 2011

On Nash Dynamics of Matching Market Equilibria

[BibT_eX]

[DOI]

CoRR, 2011

On the Approximability of Budget Feasible Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Computation and Incentives of Competitive Equilibria in a Matching Market.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

A Market Clearing Solution for Social Lending.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

How Profitable Are Strategic Behaviors in a Market?

[BibT_eX]

[DOI]

Jie Zhang

Proceedings of the Algorithms - ESA 2011, 2011

2010

Dynamic pricing for impatient bidders.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Competitive equilibria in matching markets with budgets.

[BibT_eX]

[DOI]

SIGecom Exch., 2010

Frugal Mechanism Design via Spectral Techniques.

[BibT_eX]

[DOI]

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Strongly Stable Assignment.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

Refining the Cost of Cheap Labor in Set System Auctions.

[BibT_eX]

[DOI]

Edith Elkind

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Social lending.

[BibT_eX]

[DOI]

Nicolas S. Lambert

Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Approximating Matches Made in Heaven.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Walrasian Equilibrium: Hardness, Approximations and Tractable Instances.

[BibT_eX]

[DOI]

Atri Rudra

Algorithmica, 2008

2007

Cheap labor can be expensive.

[BibT_eX]

[DOI]

Anna R. Karlin

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2004

On complexity of single-minded auction.

[BibT_eX]

[DOI]

Xiaoming Sun

J. Comput. Syst. Sci., 2004

Approximation for Dominating Set Problem with Measure Functions.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 2004

Fully Truthful Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

Dynamic Price Sequence and Incentive Compatibility (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Fisher Equilibrium Price with a Class of Concave Utility Functions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

2003

Combinatorial auction across independent markets (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Double Auction in Two-Level Markets.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2003, 2003

Incentive Compatible Mechanism Based on Linear Pricing Scheme for Single-Minded Auction.

[BibT_eX]

[DOI]