skip to main content

Explore Research Products in the NSF-PAR

  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Li, Wenzheng"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ( , ACM)
    Mohar, Bojan ; Shinkar, Igor ; O'Donnell, Ryan (Ed.)
    We present a constant-factor approximation algorithm for the Nash Social Welfare (NSW) maximization problem with subadditive valuations accessible via demand queries. More generally, we propose a framework for NSW optimization which assumes two subroutines which (1) solve a configuration-type LP under certain additional conditions, and (2) round the fractional solution with respect to utilitarian social welfare. In particular, a constant-factor approximation for submodular valuations with value queries can also be derived from our framework. 
    more » « less
    Free, publicly-accessible full text available June 11, 2025
  2. ; ; ; ( , ACM)
    Mohar, Bojan ; Shinkar, Igor ; O'Donnell, Ryan (Ed.)
    We present a constant-factor approximation algorithm for the Nash Social Welfare (NSW) maximization problem with subadditive valuations accessible via demand queries. More generally, we propose a framework for NSW optimization which assumes two subroutines that (1) solve a conguration-type LP under certain additional conditions, and (2) round the fractional solution with respect to utilitarian social welfare. In particular, a constant-factor approximation for submodular valuations with value queries can also be derived from our framework. 
    more » « less
    Free, publicly-accessible full text available June 10, 2025
  3. ; ; ; ; ( , Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC))
    Full Text Available 
  4. ; ( , 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS))
    Nisheeth K. Vishnoi (Ed.)
    We present a 380-approximation algorithm for the Nash Social Welfare problem with submodular valuations. Our algorithm builds on and extends a recent constant-factor approximation for Rado valuations [15]. 
    more » « less
    Full Text Available 
  5. ; ; ( , SIAM Journal on Computing)
    Full Text Available 
  6. ; ; ; ; ( , ACM Transactions on Algorithms)
    Full Text Available 
  7. ; ; ( , Proceedings 50th ACM Symposium on Theory of Computing)
    Full Text Available 
  8. ; ; ; ; ( , SODA 2018)
    Full Text Available 
  9. ; ; ; ; ; ( , Proceedings 37th Symposium on Principles of Distributed Computing)
    Full Text Available