Skip to main content

4 Result(s)

within Shengxin Liu Remove this filter Algorithm Analysis and Problem Complexity Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Fair Division with Allocator’s Preference

    We consider the problem of fairly allocating indivisible resources to agents, which has been studied for years. Most previous work focuses on fairness and/or efficiency among agents given agents’ preferences. How...

    **aolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song… in Web and Internet Economics (2024)

  2. No Access

    Chapter and Conference Paper

    EFX Under Budget Constraint

    Fair division captures many real-world scenarios and plays an important role in many research fields including computer science, economy, operations research, etc. For the problem of indivisible goods allocati...

    Sijia Dai, Guichen Gao, Shengxin Liu, Boon Han Lim… in Frontiers of Algorithmic Wisdom (2022)

  3. No Access

    Chapter and Conference Paper

    A Simple Greedy Algorithm for the Profit-Aware Social Team Formation Problem

    Team formation in social networks has attracted much attention due to its many applications such as the online labour market. In this paper, we focus on the problem of forming multiple teams of experts with di...

    Shengxin Liu, Chung Keung Poon in Combinatorial Optimization and Applications (2017)

  4. No Access

    Chapter and Conference Paper

    Optimal Algorithms for Running Max and Min Filters on Random Inputs

    Given a d-dimensional array and an integer p, the max (or min) filter is the set of maximum (or minimum) elements within a d-dimensional sliding window of edge length p inside the array. The current best algorith...

    Hongyu Liang, Shengxin Liu, Hao Yuan in Computing and Combinatorics (2015)