Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Zhou Shengwei"'
Publikováno v:
International Journal of Metrology and Quality Engineering, Vol 15, p 13 (2024)
In response to issues such as poor-fitting accuracy in the remote water meter measurement curve, unsatisfactory fitting effects, and challenges in depicting real data characteristics, a weighted least squares algorithm is proposed based on the remote
Externí odkaz:
https://doaj.org/article/5f53a77585ab469e9167f6b88c052cab
Publikováno v:
International Journal of Metrology and Quality Engineering, Vol 15, p 12 (2024)
Rapidly and accurately diagnosing power battery faults in new energy vehicles can significantly improve battery safety. Aiming at the collected power battery historical fault data information, a power battery fault diagnosis method based on an improv
Externí odkaz:
https://doaj.org/article/5f01d59ed25043f5b30ae224d3b6fb94
We study the problem of allocating $m$ indivisible chores to $n$ agents with additive cost functions under the fairness notion of maximin share (MMS). In this work, we propose a notion called $\alpha$-approximate all-but-one maximin share ($\alpha$-A
Externí odkaz:
http://arxiv.org/abs/2410.12347
Autor:
Wu, Xiaowei, Zhou, Shengwei
We consider the problem of allocating $m$ indivisible items to a set of $n$ heterogeneous agents, aiming at computing a proportional allocation by introducing subsidy (money). It has been shown by Wu et al. (WINE 2023) that when agents are unweighted
Externí odkaz:
http://arxiv.org/abs/2404.07707
We study the problem of allocating a group of indivisible chores among agents while each chore has a binary marginal. We focus on the fairness criteria of envy-freeness up to any item (EFX) and investigate the existence of EFX allocations. We show th
Externí odkaz:
http://arxiv.org/abs/2308.12177
We consider the problem of fair allocation of $m$ indivisible items to a group of $n$ agents with subsidy (money). Our work mainly focuses on the allocation of chores but most of our results extend to the allocation of goods as well. We consider the
Externí odkaz:
http://arxiv.org/abs/2307.04411
We consider the online bipartite matching problem on $(k,d)$-bounded graphs, where each online vertex has at most $d$ neighbors, each offline vertex has at least $k$ neighbors, and $k\geq d\geq 2$. The model of $(k,d)$-bounded graphs is proposed by N
Externí odkaz:
http://arxiv.org/abs/2306.13387
We consider the problem of fairly allocating a sequence of indivisible items that arrive online in an arbitrary order to a group of n agents with additive normalized valuation functions. We consider both the allocation of goods and chores and propose
Externí odkaz:
http://arxiv.org/abs/2304.13405
We consider the edge-weighted online stochastic matching problem, in which an edge-weighted bipartite graph G=(I\cup J, E) with offline vertices J and online vertex types I is given. The online vertices have types sampled from I with probability prop
Externí odkaz:
http://arxiv.org/abs/2302.05633
We study how to fairly allocate a set of indivisible chores to a group of agents, where each agent $i$ has a non-negative weight $w_i$ that represents its obligation for undertaking the chores. We consider the fairness notion of weighted envy-freenes
Externí odkaz:
http://arxiv.org/abs/2301.08090