A5040401683- Game Theory and Voting Systems
- Auction Theory and Applications
- Logic, Reasoning, and Knowledge
- Traffic Prediction and Management Techniques
- Experimental Behavioral Economics Studies
- Autonomous Vehicle Technology and Safety
- Optimization and Variational Analysis
- Video Surveillance and Tracking Methods
- Photoacoustic and Ultrasonic Imaging
- Optimization and Search Problems
- Advanced SAR Imaging Techniques
- Economic theories and models
- Image Processing Techniques and Applications
- Advanced Bandit Algorithms Research
- Consumer Market Behavior and Pricing
- Blockchain Technology Applications and Security
- Free Will and Agency
- Advanced Algebra and Logic
- Complexity and Algorithms in Graphs
Xidian University
2024
University of Macau
2022-2023
City University of Macau
2022
The accurate trajectory prediction of surrounding vehicles is crucial for the sustainability and safety connected autonomous under mixed traffic streams in real world. task challenging because there are all kinds factors affecting motions vehicles, such as individual movements, ambient driving environment especially road conditions, interactions with neighboring vehicles. To resolve above issues, this work proposes a novel Heterogeneous Context-Aware Graph Convolutional Networks following...
We study how to fairly allocate a set of indivisible chores group agents, where each agent i ∈ N has an additive cost function ci and non-negative weight wi that represents its obligation for undertaking the chores. consider fairness notion weighted envy-freeness up one item (WEF1), which requires ci(Xi \ {e})/wi after removing most costly e is at ci(Xj)/wj any other j. While WEF1 allocations goods can be computed in polynomial time (Chakraborty et al. TEAC 2021), existence still open...
In this paper we study how to fairly allocate a set of m indivisible chores group n agents, each which has general additive cost function on the items. Since envy-free (EF) allocation is not guaranteed exist, consider notion envy-freeness up any item (EFX). contrast fruitful results regarding (approximation of) EFX allocations for goods, very little known chores. Prior our work, chores, it that always exist two or number agents with identical ordering functions. For instances, no non-trivial...
In this paper, we study how to fairly allocate a set of m indivisible chores group n agents, each which has general additive cost function on the items. Since envy-free (EF) allocations are not guaranteed exist, consider notion envy-freeness up any item (EFX). contrast fruitful results regarding (approximation of) EFX for goods, very little is known allocation chores. Prior our work, chores, it that always exist two agents or number with identical ordering functions. For instances, no...
We study the problem of allocating a group indivisible chores among agents while each chore has binary marginal. focus on fairness criteria envy-freeness up to any item (EFX) and investigate existence EFX allocations. show that when have additive cost functions, there exist Pareto-optimal (PO) allocations can be computed in polynomial time. To best our knowledge, this is first setting general number admits PO allocations, before which only been shown for three bivalued agents. further...
We consider the problem of fair allocation $m$ indivisible items to a group $n$ agents with subsidy (money). Our work mainly focuses on chores but most our results extend goods as well. case when have (general) additive cost functions. Assuming that maximum an item agent can be compensated by one dollar, we show total $n/4$ dollars suffices ensure proportional allocation. Moreover, is tight in sense there exists instance for which every requires at least $n/4$. also weighted and $(n-1)/2$