Academia.eduAcademia.edu

matching function

description305 papers
group6 followers
lightbulbAbout this topic
A matching function is a mathematical representation that describes the relationship between the number of job vacancies and the number of unemployed individuals in an economy, illustrating how these two groups interact to determine the efficiency of labor market matching processes.
lightbulbAbout this topic
A matching function is a mathematical representation that describes the relationship between the number of job vacancies and the number of unemployed individuals in an economy, illustrating how these two groups interact to determine the efficiency of labor market matching processes.

Key research themes

1. Under what conditions does a matching problem possess a unique stable matching, and how can these conditions be characterized using the concept of normal form and acyclic preferences?

This research area focuses on characterizing the uniqueness of stable matchings, a central question in matching theory and economics. Uniqueness is desirable as it ensures predictability, Pareto efficiency, and strategy-proofness in mechanisms. The concept of a problem's normal form—stripping preferences of irrelevant information for stable matchings—and the acyclicity condition on preferences within this normal form provide a necessary and sufficient characterization for uniqueness. This theme has significance both theoretically and practically, shedding light on market behavior and mechanism design.

Key finding: Established that a matching problem has a unique stable matching if and only if preferences restricted to the problem's normal form satisfy the well-known acyclicity condition. This was the first result providing a necessary... Read more
Key finding: Studied restricted preference models (k-bounded, k-attribute, k-range, k-list) and characterized the corresponding rotation poset structures, which are key to understanding the lattice of stable matchings and their number.... Read more
Key finding: Developed fixed-parameter tractable algorithms and kernelization results for maximizing/minimizing stable matchings under ties and incomplete preference lists, thus providing algorithmic tools to analyze uniqueness and... Read more

2. How can many-to-many and one-sided matching problems with capacities, multiple partnerships, and complex preferences be modeled and computed to capture real-world scenarios beyond classical one-to-one matchings?

This theme investigates generalizations of classical matching models, such as many-to-many matchings with demands and capacities and one-sided many-to-many models allowing multiple edges between agents. These models apply to labor markets, sports scheduling, and kidney exchanges. They focus on stability and efficiency concepts adapted to more complex interaction patterns, developing algorithmic solutions including polynomial time algorithms and characterizations based on graph theory.

Key finding: Introduced a one-sided many-to-many matching model where agents can form multiple partnerships, possibly multiple with the same partner, and characterized stable and Pareto efficient matchings using graph-theoretic concepts.... Read more
Key finding: Presented a polynomial-time algorithm to find minimum-cost many-to-many matchings with lower and upper bounds (demands and capacities) on matches per agent, leveraging the Hungarian algorithm framework. This extends classical... Read more
Key finding: Corrected and extended prior models of matching functions allowing workers multiple applications, accounting accurately for dependence between applications, and derived limiting results for expected matches as market size... Read more

3. What algorithmic and theoretical frameworks can be used to efficiently solve graph and pattern matching problems, including order-preserving, parameterized, and quadratic assignment formulations?

This line of research studies algorithmic methods and mathematical characterizations for matching problems formulated as graph matching (quadratic assignment), order-preserving string matching, and parameterized matching. These problems arise in areas such as object categorization, music retrieval, software maintenance, and bioinformatics. Advances include continuous domain relaxations, efficient approximation algorithms, algorithms exploiting structural restrictions, and theoretical generalizations enabling practical computation.

Key finding: Demonstrated that a large class of 'Separable Functions' can approximate graph matching formulated as quadratic assignment problems in the continuous domain, enabling new algorithmic approaches using convex/concave-preserving... Read more
Key finding: Proposed an approximate order-preserving matching problem variant allowing bounded individual and global ranking errors, and developed an algorithm solving it efficiently in O(nm + m log m) time, broadening flexibility in... Read more
Key finding: Surveyed the string parameterized matching problem and its variants, providing algorithmic foundations and extensions with bijective mappings between parameter alphabets, with applications in software maintenance, image... Read more

All papers in matching function

Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Zadeh's fuzzy set and Atanassov's intuitionistic fuzzy set. In this paper, we first develop some similarity measures of neutrosophic sets. We... more
The Institute for Labour Market Policy Evaluation (IFAU) is a research insti tute under the Swedish Ministry of Employment, situated in Uppsala. IFAU's objective is to promote, support and carry out: evaluations of the effects of la bour... more
The Institute for Labour Market Policy Evaluation (IFAU) is a research insti tute under the Swedish Ministry of Employment, situated in Uppsala. IFAU's objective is to promote, support and carry out: evaluations of the effects of la bour... more
When the trading process is characterized by search frictions, traders may be rationed so markets need not clear. We build a general equilibrium model with transferable utility where the uncertainty arising from rationing is incorporated... more
When the trading process is characterized by search frictions, traders may be rationed so markets need not clear. We argue that rationing can be part of general equilibrium, even if it is outside its normal interpretation. We build a... more
Monthly panel (1998)(1999)(2000)(2001)(2002)(2003)) data from regional labor offices in Latvia are used to analyze the matching process in a high unemploymentlow labor demand environment and to evaluate the impact of active labor market... more
RGD-coupled silk protein-biomaterial lamellar systems were prepared and studied with human cornea fibroblasts (hCFs) to match functional requirements. A strategy for corneal tissue engineering was pursued to replicate the structural... more
We study different trading processes in the context of a search-based model of endogenous money. We incorporate heterogeneity into the model by allowing multiple meetings of agents and divisible production. We then determine the... more
We examined contrast sensitivity and suprathreshold apparent contrast with natural images. The spatialfrequency components within single octaves of the images were removed (notch filtered), their phases were randomized, or the polarity of... more
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the values of some attributes for two tuples, provided that the... more
In this study, we investigate information retrieval (IR) on Turkish texts using a large-scale test collection that contains 408,305 documents and 72 ad hoc queries. We examine the effects of several stemming options and query-document... more
This paper provides a dynamic analysis of the market for academic publications. Given imperfect information about journals' editorial line, authors can sometimes target a wrong journal; in turn, the editor will desk-reject their paper. An... more
Subject to a huge and growing number of journal titles in business and economics, scholars sometimes target the wrong journal. Editors resort more and more to paper pre-screening, and desk reject those that do not fit well to the... more
We present the results of the first large-scale Turkish information retrieval experiments performed on a TREC-like test collection. The test bed, which has been created for this study, contains 95.5 million words, 408,305 documents, 72 ad... more
We survey the microfoundations, empirical evidence and estimation issues underlying the aggregate matching function. Several microeconomic matching mechanisms have been suggested in the literature with some successes but none is generally... more
Motion estimation is one of the most important steps in video compression algorithms. It reduces temporal redundancy present in frame sequences and allows a better compression of video material. Most of the actual video compression... more
This paper provides a dynamic analysis of the market for academic publications. Given imperfect information about journals' editorial line, authors can sometimes target a wrong journal; in turn, the editor will desk-reject their paper. An... more
Given the myriad of journal titles in economics and business administration, scholars can sometimes target the wrong journal. This paper provides a dynamic analysis of the market for academic publications that brings into the picture this... more
We investigate the practice of using probabilistically gen- erated melodies to do large scale evaluations of query-by- humming systems by running a set of sung queries against both real and synthetic databases, using an already verified... more
This paper focuses on friction problems in the matching process arising in a dual labour market where good and bad jobs coexist. Specifically, we investigate the role of strong preferences for permanent contracts, in a labour market where... more
Semantic Web service discovery finds a match between service requirement and service advertisements based on the semantic description. The discovery mechanism does not consider quality and business offers of advertised Web services. In... more
Extraction of visual descriptors is a crucial problem for stateof-the-art visual information analysis. In this paper, we present a knowledgebased approach for detection of visual objects in video sequences, extraction of visual... more
Any opinions expressed here are those of the author(s) and not those of the institute. Research disseminated by IZA may include views on policy, but the institute itself takes no institutional policy positions. The Institute for the Study... more
This Discussion Paper is issued within the framework of IZA’s research area The Welfare State and Labor Markets. Any opinions expressed here are those of the author(s) and not those of the institute. Research disseminated by IZA may... more
, and many supportive friends and helpful seminar participants. All errors, of course, are my o wn. 2 This paper comprises the core sections of my dissertation, Costain (Aug. 1997).
FingerCode is a fingerprint correlation matching scheme that relies on texture information. In this scheme, the oriented components are extracted from a fingerprint image using a bank of Gabor filters, and a directional texture feature... more
We investigated sexual and seasonal patterns in scent-marking behaviour of the honey badger, by direct observations of habituated individuals (five females, four adult males, two young males). Four categories of scent-marking behaviour... more
Service discovery is a key activity to actually identify the Web services (WSs) to be invoked and composed. Since it is likely that more than one service fulfill a set of user requirements, some ranking mechanisms based on non-functional... more
We study the absolute and relative structure of Pareto-optimal allocation mechanisms in settings where the planner considers more than one objective criterion. Specifically, we (i) characterize mechanisms that implement the entire Pareto... more
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the values of some attributes for two tuples, provided that the... more
Protein-protein interactions (PPIs) play a significant role in many crucial cellular operations such as metabolism, signaling and regulations. The computational methods for predicting PPIs have shown tremendous growth in recent years, but... more
This note corrects the matching function proposed in Albrecht, Gautier and Vroman (2003a). It also veri…es that the limiting result given in that note is correct.
Contrast matching was performed with isoluminant red-green and scone gratings at spatial frequencies ranging from 0.5 to 8 c/deg. Contrast threshold curves were low-pass in shape, in agreement with previous findings. Contrast matching... more
The contrast matching function (CMF) is the reciprocal of test contrast that perceptually matches the contrast of standard pattern, measured as a function of test spatial frequency (SF). Achromatic CMFs usually flatten as the contrast of... more
Our paper analyzes and compares two attempts at integrating unemployment in macroeconomics. The first, due to Peter Diamond, consists in a search model exhibiting multiple equilibria and wherein cycles may be produced. The second is due... more
This paper is concerned with the effect of the unemployment insurance system and of training programs on unemployment outflow rates disaggregated by sex and two unemployment duration categories. The model is based on a matching function... more
It has been predicted, both theoretically and by computer simulation, that in capillary electrophoresis the electromigration-dispersion-induced peak broadening can be eliminated by matching the mobilities of the analyte and the background... more
Cet article decrit une contrainte d'un modele de recherche d'information decrivant les comportement attendu d'un systeme si un document du corpus est pose en requete, la contrainte DDMC (Document-Document Matching Constraint).... more
This note corrects the matching function proposed in Albrecht, Gautier and Vroman (2003a). It also veri…es that the limiting result given in that note is correct.
We investigate job competition among job seekers and vacancy competition among firms extending the job competition model proposed by Anderson and Burgess (Anderson, P.M., Burgess, S.M., 2000. Empirical matching functions: Estimation and... more
Starting in January 2003, Germany implemented the first two so-called Hartz reforms, followed by the third and fourth packages of Hartz reforms in January 2004 and January 2005, respectively. The aim of these reforms was to accelerate... more
Download research papers for free!