Browsing by Author "Lai, John Kwang"

Now showing items 1-5 of 5

    • Monotone Branch-and-Bound Search for Restricted Combinatorial Auctions 

      Lai, John Kwang; Parkes, David C. (ACM Press, 2012)
      Faced with an intractable optimization problem, a common approach to computational mechanism design seeks a polynomial time approximation algorithm with an approximation guarantee. Rather than adopt this worst-case viewpoint, ...

    • Optimal Envy-Free Cake Cutting 

      Cohler, Yuga Julian; Lai, John Kwang; Parkes, David C.; Procaccia, Ariel (Association for the Advancement of Artificial Intelligence Press, 2011)
      We consider the problem of fairly dividing a heterogeneous divisible good among agents with different preferences. Previous work has shown that envy-free allocations, i.e., where each agent prefers its own allocation to ...

    • Payment Rules through Discriminant-Based Classifiers 

      Dütting, Paul; Fischer, Felix; Jirapinyo, Pichayut; Lai, John Kwang; Lubin, Benjamin; Parkes, David C. (ACM Press, 2012)
      In mechanism design it is typical to impose incentive compatibility and then derive an optimal mechanism subject to this constraint. By replacing the incentive compatibility requirement with the goal of minimizing expected ...

    • Truth, Justice, and Cake Cutting 

      Chen, Yiling; Lai, John Kwang; Parkes, David C.; Procaccia, Ariel D. (Association for the Advancement of Artificial Intelligence, 2010)
      Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of them also take into account self-interested ...

    • Truthful and Fair Resource Allocation 

      Lai, John Kwang (2013-09-25)
      How should we divide a good or set of goods among a set of agents? There are various constraints that we can consider. We consider two particular constraints. The first is fairness - how can we find fair allocations? The ...