skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Thursday, October 10 until 2:00 AM ET on Friday, October 11 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the NSF-PAR

  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Creators/Authors contains: "Rubinstein, Aviad"

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. ; ( , Leibniz international proceedings in informatics)
    Full Text Available 
  4. ; ; ; ( , Games and Economic Behavior)
    Full Text Available 
  5. ; ( , STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing)
    Full Text Available 
  6. ; ; ; ; ( , ACM SIGACT Symposium on Theory of Computing)
    null (Ed.)
    Full Text Available 
  7. ; ; ; ; ; ; ; ( , Leibniz international proceedings in informatics)
    Full Text Available 
  8. ; ; ; ( , 020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS))
    null (Ed.)
    Full Text Available 
  9. ; ; ( , STOC)
    Full Text Available 
  10. ; ; ( , Innovations in Theoretical Computer Science)
    Full Text Available