Postdoc Positions at UNSW

 

Postdoctoral Fellow – Artificial Intelligence

Apply nowJob no: 499991
Work type: Full-time
Location: Sydney, NSW
Categories: Post doctoral research fellow

The Opportunity

You will join the Algorithmic Decision Theory (ADT) group which seeks to develop computational tools to support decision making. This involves multi-disciplinary research on the boundaries of optimisation, preferences, social choice, game theory, multi-agent systems, and machine learning. Research is driven by several transformative factors: the web (which is creating many new and exciting business models), big data (which is transforming the way we can optimise many industries), and environmental and financial pressures (which are forcing us to look for more optimal solutions). Current projects within the group include: representing and reasoning with preferences, computational social choice, fair division, game theoretic issues in distributed optimisation, and the intersection of machine learning and optimisation.

  • Salary, $96,404 - $103,112 + superannuation
  • Full time
  • Fixed-term contract – 5 years
  • Location: Kensington – Sydney, Australia

About UNSW

UNSW is currently implementing a ten-year strategy to 2025 and our ambition for the next decade is nothing less than to establish UNSW as Australia’s global university. This position is within the School of Computer Science and Engineering

Selection Criteria

  • PhD (or soon to be awarded) in Artificial Intelligence or related area such as computational economics.
  • Demonstrated mathematics, statistics, and computer programming skills relevant to modelling of problems in social choice.
  • Able to conduct independent research with limited supervision.
  • Track record of publications and conference presentations relative to opportunity.
  • Able to work in a team, collaborate across disciplines and build effective relationships.
  • Strong interpersonal skills with demonstrated ability to communicate and interact with a diverse range of stakeholders and students.
  • Strong analytical and quantitative skills.
  • Knowledge of health and safety responsibilities and commitment to attending relevant health and safety training.

Additional details about the specific responsibilities for these positions can be found in the position description via the advert on https://www.jobs.unsw.edu.au/

Within your application you should address the selection criteria which are listed within the position description. 

Please apply online via https://www.jobs.unsw.edu.au/. Applications will not be accepted if sent to the contact listed on the UNSW Jobs website. 

Contact:

Nikki Hayes

E: nikki.hayes@unsw.edu.au

Applications close: 11:50pm, Sunday 18th October 2020

Comments

Post a Comment

Popular posts from this blog

Smart Lotteries in School Choice Ex-ante Pareto-Improvement with Ex-post Stability

Image
Working Paper: https://cgi.cse.unsw.edu.au/~haziz/PIRMES.pdf  Abstract: In a typical school choice application, the students have strict preferences over the schools while the schools have coarse priorities over the students based on their distance and their enrolled siblings. The outcome of a centralized admission mechanism is then usually obtained by the Deferred Acceptance (DA) algorithm with random tie-breaking. Therefore, every possible outcome of this mechanism is a stable solution for the coarse priorities that will arise with certain probability. This implies a probabilistic assignment, where the admission probability for each student-school pair is specified. In this paper, we propose a new efficiency-improving stable `smart lottery' mechanism. We aim to improve the probabilistic assignment ex-ante in a stochastic dominance sense, while ensuring that the improved random matching is still ex-post stable, meaning that it can be decomposed into stable matchings regarding the ...
Read more

Proportionally Representative Clustering

Image
H. Aziz, B. Lee, S. Morota Chu, and J. Vollen. Proportionally Representative Clustering.  WINE 2024 .  [  Pdf  ]  In recent years, there has been a surge in effort to formalize notions of fairness in machine learning. We focus on centroid clustering— one of the fundamental tasks in unsupervised machine learning. We pro- pose a new axiom “proportionally representative fairness” (PRF) that is designed for clustering problems where the selection of centroids re- flects the distribution of data points and how tightly they are clustered together. Our fairness concept is not satisfied by existing fair cluster- ing algorithms. We design efficient algorithms to achieve PRF both for unconstrained and discrete clustering problems. Our algorithm for the unconstrained setting is also the first known polynomial-time approxi- mation algorithm for the well-studied Proportional Fairness (PF) axiom [ 13 ]. Our algorithm for the discrete setting also matches the best kn...
Read more

Fair budgets from ranked ballots: PB-EAR

How do you split a shared budget fairly when people rank projects that cost very different amounts? PB-EAR, from our AAAI 2021 paper  Proportionally Representative Participatory Budgeting with Ordinal Preferences  ( AAAI version ), gives every voter an equal slice of the budget and lets groups pool their slices to fund the projects they rank highest, looking further down the ballots only when nothing is yet affordable. Every cohesive group is guaranteed its proportional share, and the rule extends our  Expanding Approvals Rule  for elections to budgets with project costs, ties and unequal voter weights.  That makes it a natural fit for DAO grant rounds such as   TheDAO Security Fund 's ETHSecurity Initiatives, where badge holders will rank the security initiatives listed on   the app  to allocate the fund's budget. The two-minute video below walks through a worked example. Here's an educational tool someone built to show how PB-EAR works. 
Read more