Organizing Computational Problem Solving Communities via Collusion Resilient Semantic Game Tournaments
Ahmed Abdelmeged's dissertation has been completed with the help of the Comprehensive exam committee.
It is the advisor's opinion that the dissertation is outstanding because of the amount of abstraction and invention that had to be accomplished given the sea of game data from synthetic semantic games. Discovering the right definitions and theorems and proving them can be done only by a few PhD students.
Thomas Wahl has indicated several months ago that he would like to have Ravi Sundaram on the committee. I have taken that advice seriously and given Ravi summaries on what Ahmed is doing through the past year. It was Ravi who brought the connection to Social Choice Theory to our attention. Ravi also judged the ``interestingness'' of Ahmed's results.
Ravi has graciously agreed to serve on the committee and check the crucial chapter 4. The reasons for chosing Ravi are: Ravi knows about social choice theory, game theory, and tournaments. He knows about a lot of different computational problems which could be all represented in our system. Ravi knows the connections between algorithms, logical sentences and their Skolem functions and semantic games.
External Examiner: Nicole Immorlica, Researcher at Microsoft New England.
Karl Lieberherr (advisor)
Ahmed's dissertation brings together three areas: (1) Social choice theory (axiomatic treatment of ranking functions for tournaments of side-choosing games) (Ravi Sundaram and Nicole Immorlica) (2) Programming languages and formal methods (declarative programming for the global brain using generalized semantic games) (Thomas Wahl), (3) Mechanism Design: predict and shape behavioral patterns in markets and games (Nicole Immorlica)
-- Karl Lieberherr, May 1, 2014.