#### Filter Results:

- Full text PDF available (32)

#### Publication Year

2003

2019

- This year (16)
- Last 5 years (53)
- Last 10 years (58)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Yishay Mansour, Aviad Rubinstein, Shai Vardi, Ning Xie
- ICALP
- 2012

We give a general method for converting online algorithms to local computation algorithms, by selecting a random permutation of the input, and simulating running the online algorithm. We bound theâ€¦ (More)

- Aviad Rubinstein
- Electronic Colloquium on Computational Complexity
- 2015

- Aviad Rubinstein, S. Matthew Weinberg
- TEAC
- 2018

We study the revenue maximization problem of a seller with n heterogeneous items for sale to a single buyer whose valuation function for sets of items is unknown and drawn from some distribution D.â€¦ (More)

- Aviad Rubinstein
- IEEE 57th Annual Symposium on Foundations ofâ€¦
- 2016

In our recent paper [Rubinstein 2016] we rule out a PTAS for the 2-Player Nash Equilibrium Problem. More precisely, we prove that there exists a constant Ïµ > 0 such that, assuming the Exponentialâ€¦ (More)

- Yakov Babichenko, Aviad Rubinstein
- STOC
- 2017

For a constant Ã‘Â”, we prove a (<i>N</i>) lower bound on the (randomized) communication complexity of Ã‘Â”-Nash equilibrium in two-player <i>N</i>ÃƒÂ— <i>N</i> games. For <i>n</i>-player binary-actionâ€¦ (More)

- Eric Balkanski, Aviad Rubinstein, Yaron Singer
- STOC
- 2017

In this paper we consider the following question: can we optimize objective functions from the training data we use to learn them? We formalize this question through a novel framework we callâ€¦ (More)

We conjecture that PPAD has a PCP-like complete problem, seeking a near equilibrium in which all but very few players have very little incentive to deviate. We show that, if one assumes that thisâ€¦ (More)

- Aviad Rubinstein, Lior Seeman, Yaron Singer
- EC
- 2015

Adapting Seeding is a key algorithmic challenge of influence maximization in social networks. One seeks to select among certain available nodes in a network, and then, adaptively, among neighbors ofâ€¦ (More)

- Aviad Rubinstein, S. Matthew Weinberg
- ArXiv
- 2015

We study the revenue maximization problem of a seller with n heterogeneous items for sale to a single buyer whose valuation function for sets of items is unknown and drawn from some distribution D.â€¦ (More)

- Shafi Goldwasser, Huijia Lin, Aviad Rubinstein
- IACR Cryptology ePrint Archive
- 2011

We present a designated verifier CS proof system for polynomial time computations. The proof system can only be verified by a designated verifier: one who has published a public-key for which itâ€¦ (More)