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 |
How this entity was disambiguated
This entity first appeared as the object of triple T9958218 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: Aviad Rubinstein Context triple: [Amos Fiat, coAuthor, Aviad Rubinstein]
-
A.
Uri Zvi Greenberg
Uri Zvi Greenberg was a prominent 20th-century Hebrew poet and journalist known for his intense nationalist themes, expressionist style, and influential role in shaping modern Hebrew literature.
-
B.
Joshua Itzhak Feldman
Joshua Itzhak Feldman, better known as Jerry Fielding, was an American composer and arranger renowned for his innovative and often darkly textured film and television scores, including collaborations with director Sam Peckinpah.
-
C.
Arnon Grunberg
Arnon Grunberg is a Dutch novelist, essayist, and columnist known for his darkly comic, psychologically incisive works that explore themes of identity, war, and human vulnerability.
-
D.
Ephraim Katzir
Ephraim Katzir was an Israeli biophysicist and politician who served as the fourth President of Israel and was renowned for his pioneering work in the field of protein chemistry.
-
E.
David Ussishkin
David Ussishkin is an Israeli archaeologist renowned for his long-term directorship of major excavations at the ancient site of Megiddo and his contributions to the study of biblical-era Levantine archaeology.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Aviad Rubinstein Target entity description: Aviad Rubinstein is a computer scientist known for his work in theoretical computer science, particularly in computational complexity and algorithmic game theory.
-
A.
Uri Zvi Greenberg
Uri Zvi Greenberg was a prominent 20th-century Hebrew poet and journalist known for his intense nationalist themes, expressionist style, and influential role in shaping modern Hebrew literature.
-
B.
Joshua Itzhak Feldman
Joshua Itzhak Feldman, better known as Jerry Fielding, was an American composer and arranger renowned for his innovative and often darkly textured film and television scores, including collaborations with director Sam Peckinpah.
-
C.
Arnon Grunberg
Arnon Grunberg is a Dutch novelist, essayist, and columnist known for his darkly comic, psychologically incisive works that explore themes of identity, war, and human vulnerability.
-
D.
Ephraim Katzir
Ephraim Katzir was an Israeli biophysicist and politician who served as the fourth President of Israel and was renowned for his pioneering work in the field of protein chemistry.
-
E.
David Ussishkin
David Ussishkin is an Israeli archaeologist renowned for his long-term directorship of major excavations at the ancient site of Megiddo and his contributions to the study of biblical-era Levantine archaeology.
- F. None of above. chosen
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 ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Subject: Aviad Rubinstein Description of subject: Aviad Rubinstein is a computer scientist known for his work in theoretical computer science, particularly in computational complexity and algorithmic game theory.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.