>
home

Latest Post

SACT talk: On the Tradeoff between Economic Efficiency and Strategyproofness in Randomized Social Choice

Time: 1:00pm Tuesday 28 May. Location: SIT 402 Speaker: Haris Aziz, NICTA Title: On the Tradeoff between Economic Efficiency and Strategyproofness in Randomized Social Choice

Updates

  • How to receive notifications of the events related to our group: See this page.

About the group

The Sydney Algorithms and Computing Theory group nucleates researchers from the University of Sydney and NICTA interested in foundational aspects of computer science. Some of our research interests include algorithmic game theory, combinatorial optimization, computational complexity, computational geometry, graph drawing, and machine learning. The unifying theme running through our research is the inquiry into the nature of efficient computation.

These pages include information about our people, our weekly seminar,the courses we offer, possible projects for prospective students, and more.

Event calendar

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 32 other followers

Follow

Get every new post delivered to your Inbox.

Join 32 other followers