May 28, 2016 · We explore the clearing problem in the barter exchange market. The problem, described in the terminology of graph theory, is to find a set of vertex-disjoint, ...
The clearing problem in the barter exchange market is explored, it is proved that it is NP-hard to approximate the clearing problem within a factor of 14/13 ...
The problem, described in the terminology of graph theory, is to find a set of vertex-disjoint, length-restricted cycles that maximize the total weight in a ...
Aug 7, 2023 · Bibliographic details on Approximation of barter exchanges with cycle length constraints.
We explore the clearing problem in the barter exchange market. The problem, described in the terminology of graph theory, is to find a set of ...
In this paper, we investigate the aforementioned barter exchange problem from the perspective of mechanism design without money, aiming for truthful (and ...
Instead of treating cycles of different lengths equally in the reduction, we enumerate the maximal number of cycles of each length, and make multiple calls to ...
This cycle-length constraint arises naturally for several reasons. For example, in a kidney exchange, all operations in a cycle have to be performed ...
Oct 12, 2024 · In this paper, we investigate the aforementioned barter exchange problem from the perspective of mechanism design without money, aiming for ...
This paper investigates the design of truthful and efficient mechanisms for barter exchange markets with bounded trading cycles, providing both approximation ...
Missing: constraints. | Show results with:constraints.