no code implementations • 8 May 2023 • Xiaoxi Guo, Sujoy Sikdar, Lirong Xia, Yongzhi Cao, Hanpin Wang
The generalized probabilistic Boston mechanism is also ex-post EF1, and satisfies ex-ante efficiency instead of fairness.
no code implementations • 16 Jan 2023 • Tianyue Cao, BoWen Zhang, Zhao Jin, Yongzhi Cao, Hanpin Wang
To deal with properties on variable-length sequences and multilevel data structures, we propose sequence-heap separation logic which integrates sequences into logical reasoning on heap-manipulated programs.
no code implementations • 27 Jun 2022 • Zhechen Li, Ao Liu, Lirong Xia, Yongzhi Cao, Hanpin Wang
Designing private voting rules is an important and pressing problem for trustworthy democracy.
no code implementations • 28 Apr 2022 • Kun Gao, Katsumi Inoue, Yongzhi Cao, Hanpin Wang
We map the symbolic forward-chained format of LPs into NN constraint functions consisting of operations between subsymbolic vector representations of atoms.
no code implementations • 18 Sep 2021 • Xiaoxi Guo, Sujoy Sikdar, Lirong Xia, Yongzhi Cao, Hanpin Wang
In the assignment problem, the goal is to assign indivisible items to agents who have ordinal preferences, efficiently and fairly, in a strategyproof manner.
no code implementations • 22 Aug 2021 • Fengchuang Xing, Yuan-Gen Wang, Hanpin Wang, Leida Li, Guopu Zhu
To capture the long-range spatiotemporal dependencies of a video sequence, StarVQA encodes the space-time position information of each patch to the input of the Transformer.
no code implementations • 25 Apr 2020 • Xiaoxi Guo, Sujoy Sikdar, Haibin Wang, Lirong Xia, Yongzhi Cao, Hanpin Wang
For MTRAs with divisible items, we show that the existing multi-type probabilistic serial (MPS) mechanism satisfies the stronger efficiency notion of lexi-efficiency, and is sd-envy-free under strict linear preferences, and sd-weak-strategyproof under lexicographic preferences.
no code implementations • 13 Jun 2019 • Haibin Wang, Sujoy Sikdar, Xiaoxi Guo, Lirong Xia, Yongzhi Cao, Hanpin Wang
We propose multi-type probabilistic serial (MPS) and multi-type random priority (MRP) as extensions of the well known PS and RP mechanisms to the multi-type resource allocation problem (MTRA) with partial preferences.