Shengwei Zhou

Orcid: 0000-0001-9739-1308

Affiliations:
  • University of Macau, SAR, China


According to our database1, Shengwei Zhou authored at least 20 papers between 2022 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
All-but-one MMS Allocation for Chores.
Proceedings of the ACM Web Conference 2026, 2026

Allocating Chores with Restricted Additive Costs: Achieving EFX, MMS, and Efficiency Simultaneously.
Proceedings of the ACM Web Conference 2026, 2026

2025
Approximately EFX and PO Allocations for Bivalued Chores.
CoRR, January, 2025

Hyper-relational interaction modeling in multi-modal trajectory prediction for intelligent connected vehicles in smart cites.
Inf. Fusion, 2025

Incentive Analysis of Collusion in Fair Division.
Proceedings of the Web and Internet Economics - 21st International Conference, 2025

Degree-Bounded Online Bipartite Matching: OCS vs. Ranking.
Proceedings of the Web and Internet Economics - 21st International Conference, 2025

When is Truthfully Allocating Chores No Harder Than Goods?
Proceedings of the Algorithmic Game Theory - 18th International Symposium, 2025

A Little Subsidy Ensures MMS Allocation for Three Agents.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

Approximately EFX and fPO Allocations for Bivalued Chores.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

Revisiting Proportional Allocation with Subsidy: Simplification and Improvements.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

Pure Nash Equilibria of Weighted Picking Sequence Protocol is WEF1 for Two Agents.
Proceedings of the Frontiers of Algorithmics - 19th International Joint Conference, 2025

2024
Guaranteeing MMS for All but One Agent When Allocating Indivisible Chores.
CoRR, 2024

Tree Splitting Based Rounding Scheme for Weighted Proportional Allocations with Subsidy.
Proceedings of the Web and Internet Economics - 20th International Conference, 2024

On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores.
Proceedings of the Frontiers of Algorithmics - 18th International Joint Conference, 2024

2023
Vehicle Trajectory Prediction in Connected Environments via Heterogeneous Context-Aware Graph Convolutional Networks.
IEEE Trans. Intell. Transp. Syst., August, 2023

One Quarter Each (on Average) Ensures Proportionality.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Improved Competitive Ratio for Edge-Weighted Online Stochastic Matching.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Weighted EF1 Allocations for Indivisible Chores.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Multi-agent Online Scheduling: MMS Allocations for Indivisible Items.
Proceedings of the International Conference on Machine Learning, 2023

2022
Approximately EFX Allocations for Indivisible Chores.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022


  Loading...