Aviad Rubinstein
E831748
Aviad Rubinstein is a computer scientist known for his work in theoretical computer science, particularly in computational complexity and algorithmic game theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Aviad Rubinstein canonical | 1 |
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
computer scientist
ⓘ
researcher ⓘ |
| academicDiscipline |
applied mathematics
ⓘ
computer science ⓘ |
| almaMater | Princeton University NERFINISHED ⓘ |
| areaOfInfluence |
game theory in computer science
ⓘ
theory of computation ⓘ |
| citizenship | Israel ⓘ |
| degree | PhD in Computer Science ⓘ |
| doctoralAdvisor | Sanjeev Arora NERFINISHED ⓘ |
| educatedAt | Princeton University ⓘ |
| employer | Stanford University ⓘ |
| fieldOfWork |
algorithmic game theory
ⓘ
approximation algorithms ⓘ computational complexity theory ⓘ computational economics ⓘ theoretical computer science ⓘ |
| hasResearchInterest |
algorithmic mechanism design
ⓘ
complexity of equilibria ⓘ computational aspects of game theory ⓘ computational social choice ⓘ fine-grained complexity ⓘ hardness of approximation ⓘ high-dimensional geometry in algorithms ⓘ learning in games ⓘ online algorithms ⓘ |
| hasRole |
doctoral advisor
ⓘ
research supervisor ⓘ university faculty member ⓘ |
| knownFor |
hardness of approximation in game-theoretic settings
ⓘ
research on high-dimensional optimization problems ⓘ results on the complexity of Nash equilibrium computation ⓘ results on the complexity of market equilibria ⓘ work on PPAD-completeness ⓘ |
| languageSpoken |
English
ⓘ
Hebrew ⓘ |
| memberOf | theoretical computer science community ⓘ |
| nationality | Israeli ⓘ |
| notableWork |
papers on the complexity of computing Nash equilibria
ⓘ
papers on the complexity of market equilibria ⓘ results on PPAD-hardness of approximate equilibria ⓘ work on query complexity in high dimensions ⓘ |
| occupation | professor of computer science ⓘ |
| publishesIn |
algorithmic game theory venues
ⓘ
computational complexity journals ⓘ theoretical computer science conferences ⓘ |
| workLocation | Stanford, California NERFINISHED ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.