Slim tree-cut width

R Ganian, V Korchemna - Algorithmica, 2024 - Springer
Tree-cut width is a parameter that has been introduced as an attempt to obtain an analogue
of treewidth for edge cuts. Unfortunately, in spite of its desirable structural properties, it …

A fine-grained view on stable many-to-one matching problems with lower and upper quotas

N Boehmer, K Heeger - ACM Transactions on Economics and …, 2022 - dl.acm.org
In the NP-hard Hospital Residents problem with lower and upper quotas (HR-QLU), the goal
is to find a stable matching of residents to hospitals where the number of residents matched …

Satisfied and fair two-sided matching method considering dual-reference with linguistic preference

D Zhang, Z Gong, S Yan, Z Chen - Engineering Applications of Artificial …, 2024 - Elsevier
The psychological behavior characteristics of the individual reference and social reference
of the agents are significant factors in two-sided matching that cannot be ignored. How to …

Privacy-preserving stable crowdsensing data trading for unknown market

H Sun, M **ao, Y Xu, G Gao… - IEEE INFOCOM 2023 …, 2023 - ieeexplore.ieee.org
As a new paradigm of data trading, Crowdsensing Data Trading (CDT) has attracted
widespread attention in recent years, where data collection tasks of buyers are …

Privacy-Preserving Stable Data Trading for Unknown Market Based on Blockchain

Q Deng, Q Zuo, Z Li - IEEE Transactions on Mobile Computing, 2025 - ieeexplore.ieee.org
Crowdsensing Data Trading (CDT) has emerged as a novel data trading paradigm, where
market stability is crucial during the transaction matching process. However, most existing …

Stable roommates with narcissistic, single-peaked, and single-crossing preferences

R Bredereck, J Chen, UP Finnendahl… - Autonomous agents and …, 2020 - Springer
Abstract The classical Stable Roommates problem is to decide whether there exists a
matching of an even number of agents such that no two agents which are not matched to …

Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters

R Bredereck, K Heeger, D Knop… - Information and …, 2022 - Elsevier
We continue and extend previous work on the parameterized complexity analysis of the NP-
hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening …

Crowdsensing Data Trading for Unknown Market: Privacy, Stability, and Conflicts

H Sun, M **ao, Y Xu, G Gao… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
In recent years, Crowdsensing Data Trading (CDT) has emerged as a new data trading
paradigm, where buyers crowdsource data collection tasks to a group of mobile users with …

[HTML][HTML] Solving hard stable matching problems involving groups of similar agents

K Meeks, B Rastegari - Theoretical Computer Science, 2020 - Elsevier
Many important stable matching problems are known to be NP-hard, even when strong
restrictions are placed on the input. In this paper we seek to identify structural properties of …

Mechanism and algorithm for stable trading matching between coal mining and power generation companies in china

R Shi, Z Li, Z Tang, D Wang - Applied Sciences, 2022 - mdpi.com
This paper is concerned with stable trading between the coal mining and power generation
companies in China. Under the current marketized coal and planned electricity price …