Results 21 to 30 of about 1,556,418 (219)
, 2020 Consider the following problem. Some individuals in a society are X’s and others are Y ’s. Every individual of each type has to be matched with one and only one individual of the other type. For example, managers have to be matched with assistants, or pilots have to be matched with copilots.
Martin J. Osborne, Ariel Rubinstein
openaire +1 more source
On a matching arrangement of a graph and LP-orientations of a matching polyhedron [PDF]
arXiv, 2022 This paper contains a description of a connection between the matching arrangement and the matching polyhedron. A bijection between regions of the matching arragement and LP-orientations of the matching polyhedron is constructed. This bijection allows to calculate the number of LP-orientations of the matching polyhedron with the characteristic ...
arxiv
Economics Letters, 2013 Abstract In the problem of allocating workers to different projects, where each project needs a minimum number of workers assigned to it, the serial dictatorship mechanism is neither strategy proof nor Pareto efficient. We therefore propose a strategy-proof and Pareto-efficient mechanism.
Daniel Monte, Norovsambuu Tumennasan
openaire +3 more sources
Matching Algorithms: Fundamentals, Applications and Challenges [PDF]
arXiv, 2021 Matching plays a vital role in the rational allocation of resources in many areas, ranging from market operation to people's daily lives. In economics, the term matching theory is coined for pairing two agents in a specific market to reach a stable or optimal state.
arxiv
Proceedings of 27th Asilomar Conference on Signals, Systems and Computers, 1993 We describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. affine (wavelet) frames.
Y. C. Pati +2 more
semanticscholar +1 more source
Deep entity matching with pre-trained language models [PDF]
Proceedings of the VLDB Endowment, 2020 We present Ditto, a novel entity matching system based on pre-trained Transformer-based language models. We fine-tune and cast EM as a sequence-pair classification problem to leverage such models with a simple architecture.
Yuliang Li +4 more
semanticscholar +1 more source
SSRN Electronic Journal, 2002 This paper analyzes the problem of matching heterogenous agents in a Bayesian learning model. One agent gives a noisy signal to another agent, who is responsible for learning. If production has a strong informational component, a phase of cross-matching occurs, so that agents of low knowledge catch up with those of higher one.
openaire +5 more sources
AANet: Adaptive Aggregation Network for Efficient Stereo Matching [PDF]
Computer Vision and Pattern Recognition, 2020 Despite the remarkable progress made by learning based stereo matching algorithms, one key challenge remains unsolved. Current state-of-the-art stereo models are mostly based on costly 3D convolutions, the cubic computational complexity and high memory ...
Haofei Xu, Juyong Zhang
semanticscholar +1 more source
Matching a Distribution by Matching Quantiles Estimation [PDF]
Journal of the American Statistical Association, 2015 Motivated by the problem of selecting representative portfolios for backtesting counterparty credit risks, we propose a matching quantiles estimation (MQE) method for matching a target distribution by that of a linear combination of a set of random variables.
Sgouropoulos, Nikolaos +2 more
openaire +4 more sources
Excluding a Planar Matching Minor in Bipartite Graphs [PDF]
arXiv, 2021 Matching minors are a specialisation of minors fit for the study of graph with perfect matchings. The notion of matching minors has been used to give a structural description of bipartite graphs on which the number of perfect matchings can becomputed efficiently, based on a result of Little, by McCuaig et al.
arxiv