Hart eCenter SMU

Mechanisms and Algorithms for Efficient Solutions to Matching Problems

By

Anna Bogomolnaia

Mechanisms to select a public decision (voting), divide the benefits from a shared resource within network, assign agents to objects or tasks, or match two sets of agents (like men and women or workers and firms) in pairs have many practical applications. The goal of the project is an extensive study of such mechanisms, removing traditional restrictive assumptions on possible preferences of agents between outcomes and on the deterministic nature of such rules. New rules are searched for and, along with the traditional ones, are evaluated in connection with whether they satisfy socially desirable properties, such as efficiency, incentive compatibility and fairness.


Research

Projects
  2002-2003
  2001-2002
Technical Reports
Special Emphasis

Dallas Hall
Privacy PolicyRight To Know and Legal