Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    On Popular Random Assignments

    One of the most fundamental and ubiquitous problems in microeconomics and operations research is how to assign objects to agents based on their individual preferences. An assignment is called popular if there ...

    Haris Aziz, Felix Brandt, Paul Stursberg in Algorithmic Game Theory (2013)

  2. No Access

    Chapter and Conference Paper

    Pareto Optimality in Coalition Formation

    A minimal requirement on allocative efficiency in the social sciences is Pareto optimality. In this paper, we identify a far-reaching structural connection between Pareto optimal and perfect partitions that ha...

    Haris Aziz, Felix Brandt, Paul Harrenstein in Algorithmic Game Theory (2011)