Aviad Rubinstein
- Management Science and Operations Research top 5%
- Artificial Intelligence top 10%
- Computational Theory and Mathematics top 5%
- Computer Networks and Communications top 10%
- Marketing top 10%
- Co-authors
- S. Matthew WeinbergYaron SingerEric BalkanskiChristos H. PapadimitriouAbraham OthmanAlessandro ChiesaYakov BabichenkoEran Tromer
- Topics
- Complexity and Algorithms in Graphs (21 papers)Auction Theory and Applications (16 papers)Game Theory and Voting Systems (13 papers)
- Partner nations
- United StatesIsraelChina
In The Last Decade
Aviad Rubinstein
42 papers receiving 298 citations
Peers
Comparison fields: 5 of 53
- Management Science and Operations Research 162
- Artificial Intelligence 101
- Computational Theory and Mathematics 84
- Computer Networks and Communications 77
- Marketing 67
Countries citing papers authored by Aviad Rubinstein
This map shows the geographic impact of Aviad Rubinstein's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Aviad Rubinstein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Aviad Rubinstein more than expected).
Fields of papers citing papers by Aviad Rubinstein
This network shows the impact of papers produced by Aviad Rubinstein. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Aviad Rubinstein. The network helps show where Aviad Rubinstein may publish in the future.
Co-authorship network of co-authors of Aviad Rubinstein
This figure shows the co-authorship network connecting the top 25 collaborators of Aviad Rubinstein. A scholar is included among the top collaborators of Aviad Rubinstein based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Aviad Rubinstein. Aviad Rubinstein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 1 | |
| 4 | 1 | |
| 5 | 0 | |
| 6 | 1 | |
| 7 | 0 | |
| 8 | The randomized communication complexity of optimal randomized auctions | 1 |
| 9 | 2 | |
| 10 | 4 | |
| 11 | 3 | |
| 12 | 3 | |
| 13 | 14 | |
| 14 | On the Approximability of Sparse PCA | 3 |
| 15 | The Power of Optimization from Samples | 15 |
| 16 | 29 | |
| 17 | 38 | |
| 18 | 0 | |
| 19 | The Intractability of Dynamic Mechanism Design. | 4 |
| 20 | 2 |
About Aviad Rubinstein
Aviad Rubinstein is a scholar working on Management Science and Operations Research, Computational Theory and Mathematics and Marketing, having authored 52 papers that have together received 302 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (21 papers), Auction Theory and Applications (16 papers) and Game Theory and Voting Systems (13 papers). The work is most often cited by research in Management Science and Operations Research (162 citations), Marketing (67 citations) and Computational Theory and Mathematics (84 citations). Aviad Rubinstein has collaborated with scholars based in United States, Israel and China. Frequent co-authors include S. Matthew Weinberg, Yaron Singer, Eric Balkanski, Christos H. Papadimitriou, Abraham Othman, Alessandro Chiesa, Yakov Babichenko, Eran Tromer, Ran Canetti and Soheil Behnezhad. Their work appears in journals such as Operations Research, Journal of the ACM and SIAM Review.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.