Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2012.13884
Cited By
Approximate and Strategyproof Maximin Share Allocation of Chores with Ordinal Preferences
Mathematical programming (Math. Program.), 2020
27 December 2020
Haris Aziz
Bo Li
Xiaowei Wu
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Approximate and Strategyproof Maximin Share Allocation of Chores with Ordinal Preferences"
4 / 4 papers shown
An FPTAS for 7/9-Approximation to Maximin Share Allocations
Xin Huang
Shengwei Zhou
58
5
0
17 Nov 2025
Incentive Analysis of Collusion in Fair Division
Haoqiang Huang
Biaoshuai Tao
Mingwei Yang
Shengwei Zhou
126
1
0
02 Oct 2025
When is Truthfully Allocating Chores no Harder than Goods?
Algorithmic Game Theory (AGT), 2025
Bo Li
Biaoshuai Tao
Fangxiao Wang
Xiaowei Wu
Mingwei Yang
Shengwei Zhou
391
1
0
02 May 2025
Fair Shares: Feasibility, Domination and Incentives
ACM Conference on Economics and Computation (EC), 2022
Moshe Babaioff
U. Feige
156
20
0
16 May 2022
1
Page 1 of 1
