Relevant bibliographies by topics / Matching theory / Journal articles
To see the other types of publications on this topic, follow the link: Matching theory.

Journal articles on the topic 'Matching theory'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 January 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Matching theory.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Rota, Gian-Carlo. "Matching theory." Advances in Mathematics 80, no. 1 (March 1990): 134. http://dx.doi.org/10.1016/0001-8708(90)90019-j.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Echenique, Federico, SangMok Lee, Matthew Shum, and M. Bumin Yenmez. "Stability and Median Rationalizability for Aggregate Matchings." Games 12, no. 2 (April 9, 2021): 33. http://dx.doi.org/10.3390/g12020033.

Full text
Abstract:
We develop the theory of stability for aggregate matchings used in empirical studies and establish fundamental properties of stable matchings including the result that the set of stable matchings is a non-empty, complete, and distributive lattice. Aggregate matchings are relevant as matching data in revealed preference theory. We present a result on rationalizing a matching data as the median stable matching.
APA, Harvard, Vancouver, ISO, and other styles
3

Aharoni, Ron. "Infinite matching theory." Discrete Mathematics 95, no. 1-3 (December 1991): 5–22. http://dx.doi.org/10.1016/0012-365x(91)90327-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Luong, Kyle. "Matching theory: kidney allocation." University of Western Ontario Medical Journal 82, no. 1 (October 1, 2013): 14–16. http://dx.doi.org/10.5206/uwomj.v82i1.4632.

Full text
Abstract:
Lloyd Shapley and Alvin E. Roth have recently been awarded the Nobel Prize in Economics for their work in matching theory. Although branching from the field of economics, matching theory has had many implications in the world of medicine. For example, the National Residency Matching Program in the United States is an application of matching theory. The focus of this article is the application of matching theory to kidney transplant allocation. Kidney transplantation is the best treatment for end stage renal failure. Unfortunately, the demand for kidneys exceeds supply. Kidney paired exchange programs, which have begun to garner great success in increasing the number of kidney transplants worldwide, base their foundations on matching theory. Overviewed in this paper will be how these programs were created and work, their successes, and some of the unique challenges and logistical obstacles they face.
APA, Harvard, Vancouver, ISO, and other styles
5

Wakeford, Colin. "Advanced colour matching theory." Pigment & Resin Technology 27, no. 1 (February 1998): 6–8. http://dx.doi.org/10.1108/03699429810194320.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Aliprantis, C. D., G. Camera, and D. Puzzello. "A random matching theory." Games and Economic Behavior 59, no. 1 (April 2007): 1–16. http://dx.doi.org/10.1016/j.geb.2006.08.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mahavir Varma, Sushil. "Stochastic Matching Networks: Theory and Applications to Matching Platforms." ACM SIGMETRICS Performance Evaluation Review 52, no. 3 (January 9, 2025): 3–6. https://doi.org/10.1145/3712170.3712173.

Full text
Abstract:
The past decade has witnessed an accelerated growth of online marketplaces and the incorporation of electric vehicles (EVs) in the fleet of transportation systems. Online marketplaces are online platforms that facilitate transactions between buyers and sellers. These platforms are burgeoning with online gig workers constituting 5-10% of the global workforce. 1 Furthermore, the EV market is also flourishing, with EVs accounting for 14% of new car sales worldwide in 2022, a significant increase from 5% in 2020 2 owing to technological advancements, government backing, and climate change awareness. Such a rise in EV adoption is accompanied by the emergence of EV-based transportation systems constituting a fully electric fleet of taxis.
APA, Harvard, Vancouver, ISO, and other styles
8

Karlsson, Andreas. "Statistical Matching: Theory and Practice." Technometrics 49, no. 3 (August 2007): 361–62. http://dx.doi.org/10.1198/tech.2007.s507.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Scheuren, Fritz. "Statistical Matching: Theory and Practice." Journal of the American Statistical Association 102, no. 479 (September 2007): 1076–77. http://dx.doi.org/10.1198/jasa.2007.s204.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tewari, Surya P., H. Huang, and R. W. Boyd. "Theory of self-phase-matching." Physical Review A 51, no. 4 (April 1, 1995): R2707—R2710. http://dx.doi.org/10.1103/physreva.51.r2707.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Burns, Dan. "Matching Theory with Real Data." Physics Teacher 44, no. 8 (November 2006): 486. http://dx.doi.org/10.1119/1.2362932.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Brown, Alessio, Christian Merkl, and Dennis Snower. "AN INCENTIVE THEORY OF MATCHING." Macroeconomic Dynamics 19, no. 3 (October 23, 2013): 643–68. http://dx.doi.org/10.1017/s1365100513000527.

Full text
Abstract:
This paper presents a theory of the labor market matching process in terms of incentive-based, two-sided search among heterogeneous agents. The matching process is decomposed into its two component stages: the contact stage, in which job searchers make contact with employers, and the selection stage, in which they decide whether to match. We construct a theoretical model explaining two-sided selection through microeconomic incentives. Firms face adjustment costs in responding to heterogeneous variations in the characteristics of workers and jobs. Matches and separations are described through firms' job offer and firing decisions and workers' job acceptance and quit decisions. Our calibrated model for the United States can account for important empirical regularities, such as the large volatilities of labor market variables, that the conventional matching model cannot.
APA, Harvard, Vancouver, ISO, and other styles
13

Swift, Robert M. "Matching observation to addiction theory." Behavioral and Brain Sciences 19, no. 4 (December 1996): 596–97. http://dx.doi.org/10.1017/s0140525x00043259.

Full text
Abstract:
AbstractOver the years, many theories have been proposed to account for the aberrant behavior of drug dependent individuals. Heyman posits that the existing theories of drug dependence are inadequate to explain the complex processes inherent in human drug-taking. He proposes that incongruous behaviors that comprise addiction, such as continued drug use in spite of adverse consequences, can be explained by application of the matching law approach. While the matching law theory of addiction explains certain aspects of human behavior, its application to the area of addiction must be subjected to experimental verification.
APA, Harvard, Vancouver, ISO, and other styles
14

Cornuéjols, Gérard, and David Hartvigsen. "An extension of matching theory." Journal of Combinatorial Theory, Series B 40, no. 3 (June 1986): 285–96. http://dx.doi.org/10.1016/0095-8956(86)90085-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Masarani, F., and S. S. Gokturk. "Social organizations and matching theory." Theory and Decision 24, no. 1 (January 1988): 77–95. http://dx.doi.org/10.1007/bf00137224.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Gorsky, Maximilian, Raphael Steiner, and Sebastian Wiederrecht. "Matching theory and Barnette's conjecture." Discrete Mathematics 346, no. 2 (February 2023): 113249. http://dx.doi.org/10.1016/j.disc.2022.113249.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Echenique, Federico. "What Matchings Can Be Stable? The Testable Implications of Matching Theory." Mathematics of Operations Research 33, no. 3 (August 2008): 757–68. http://dx.doi.org/10.1287/moor.1080.0318.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Yang, Yunyun, and Gang Xie. "Maximum Matchings of a Digraph Based on the Largest Geometric Multiplicity." Mathematical Problems in Engineering 2016 (2016): 1–7. http://dx.doi.org/10.1155/2016/4702387.

Full text
Abstract:
Matching theory is one of the most forefront issues of graph theory. Based on the largest geometric multiplicity, we develop an efficient approach to identify maximum matchings in a digraph. For a given digraph, it has been proved that the number of maximum matched nodes has close relationship with the largest geometric multiplicity of the transpose of the adjacency matrix. Moreover, through fundamental column transformations, we can obtain the matched nodes and related matching edges. In particular, when a digraph contains a cycle factor, the largest geometric multiplicity is equal to one. In this case, the maximum matching is a perfect matching and each node in the digraph is a matched node. The method is validated by an example.
APA, Harvard, Vancouver, ISO, and other styles
19

Zhao, Jin-Hua. "A local algorithm and its percolation analysis of bipartite z-matching problem." Journal of Statistical Mechanics: Theory and Experiment 2023, no. 5 (May 1, 2023): 053401. http://dx.doi.org/10.1088/1742-5468/acd105.

Full text
Abstract:
Abstract A z-matching on a bipartite graph is a set of edges, among which each vertex of two types of the graph is adjacent to at most 1 and at most z ( ⩾ 1 ) edges, respectively. The z-matching problem concerns finding z-matchings with the maximum size. Our approach to this combinatorial optimization problem is twofold. From an algorithmic perspective, we adopt a local algorithm as a linear approximate solver to find z-matchings on any graph instance, whose basic component is a generalized greedy leaf removal procedure in graph theory. From a theoretical perspective, on uncorrelated random bipartite graphs, we develop a mean-field theory for the percolation phenomenon underlying the local algorithm, leading to an analytical estimation of z-matching sizes on random graphs. Our analytical theory corrects the prediction by belief propagation algorithm at zero-temperature limit in (Kreačić and Bianconi 2019 Europhys. Lett. 126 028001). Besides, our theoretical framework extends a core percolation analysis of k-XORSAT problems to a general context of uncorrelated random hypergraphs with arbitrary degree distributions of factor and variable nodes.
APA, Harvard, Vancouver, ISO, and other styles
20

Akin, Sumeyra. "Matching with floor constraints." Theoretical Economics 16, no. 3 (2021): 911–42. http://dx.doi.org/10.3982/te3785.

Full text
Abstract:
Floor constraints are a prominent feature of many matching markets, such as medical residency, teacher assignment, and military cadet matching. We develop a theory of matching markets under floor constraints. We introduce a stability notion, which we call floor respecting stability, for markets in which (hard) floor constraints must be respected. A matching is floor respecting stable if there is no coalition of doctors and hospitals that can propose an alternative matching that is feasible and an improvement for its members. Our stability notion imposes the additional condition that a coalition cannot reassign a doctor outside the coalition to another hospital (although she can be fired). This condition is necessary to guarantee the existence of stable matchings. We provide a mechanism that is strategy‐proof for doctors and implements a floor respecting stable matching.
APA, Harvard, Vancouver, ISO, and other styles
21

Watson, Mark, and Mary McMahon. "Matching Occupation and Self: Does Matching Theory Adequately Model Children's Thinking?" Psychological Reports 95, no. 2 (October 2004): 421–31. http://dx.doi.org/10.2466/pr0.95.2.421-431.

Full text
Abstract:
The present exploratory-descriptive cross-national study focused on the career development of 11- to 14-yr.-old children, in particular whether they can match their personal characteristics with their occupational aspirations. Further, the study explored whether their matching may be explained in terms of a fit between person and environment using Holland's theory as an example. Participants included 511 South African and 372 Australian children. Findings relate to two items of the Revised Career Awareness Survey that require children to relate personal-social knowledge to their favorite occupation. Data were analyzed in three stages using descriptive statistics, i.e., mean scores, frequencies, and percentage agreement. The study indicated that children perceived their personal characteristics to be related to their occupational aspirations. However, how this matching takes place is not adequately accounted for in terms of a career theory such as that of Holland.
APA, Harvard, Vancouver, ISO, and other styles
22

WATSON, MARK. "MATCHING OCCUPATION AND SELF: DOES MATCHING THEORY ADEQUATELY MODEL CHILDREN'S THINKING?" Psychological Reports 95, no. 6 (2004): 421. http://dx.doi.org/10.2466/pr0.95.6.421-431.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Zhuo, Huizhao. "Matching Market Design: Resource Matching Optimization in the Epidemic and Application of the Matching Theory." Advances in Economics, Management and Political Sciences 66, no. 1 (January 5, 2024): 198–205. http://dx.doi.org/10.54254/2754-1169/66/20241229.

Full text
Abstract:
During the Covid-19 pandemic, the problem of inefficiency and one-sidedness of resources matching occurred, and economists proposed an innovative scheme-- reserve system. Different categories of patients, such as those with different symptoms, health care workers, and the elderly and young population, need to be matched with extremely limited medical resources (ventilator as study object in this research) in the epidemic. The upgrade from the current priority system to the reserve system which is capable of classified allocation is more in line with the fair and comprehensive ethical values, thus solving the complex matching problem better. Based on this original reserve system, this study further assists in explaining the concept connotation of its research on matching process, proposes possible improvements, and clarifies its effects and value. Moreover, based on this idea of matching, this study analyzes its role in the matching problem of "undergraduate-college".
APA, Harvard, Vancouver, ISO, and other styles
24

McDowell, J. J. "ON THE FALSIFIABILITY OF MATCHING THEORY." Journal of the Experimental Analysis of Behavior 45, no. 1 (January 1986): 63–74. http://dx.doi.org/10.1901/jeab.1986.45-63.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Bijnens, Johan, Peter Gosdzinsky, and Pere Talavera. "Matching the heavy vector meson theory." Journal of High Energy Physics 1998, no. 01 (January 29, 1998): 014. http://dx.doi.org/10.1088/1126-6708/1998/01/014.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Serrano, Roberto. "Lloyd Shapley's Matching and Game Theory." Scandinavian Journal of Economics 115, no. 3 (June 19, 2013): 599–618. http://dx.doi.org/10.1111/sjoe.12012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Savage, Neil. "Graph matching in theory and practice." Communications of the ACM 59, no. 7 (June 24, 2016): 12–14. http://dx.doi.org/10.1145/2933412.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

S.Afonin, S., A. A.Andrianov, V. A.Andrianov, and D. Espriu. "Matching Regge Theory to the OPE." Journal of High Energy Physics 2004, no. 04 (April 20, 2004): 039. http://dx.doi.org/10.1088/1126-6708/2004/04/039.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Aonishi, Toru, and Koji Kurata. "Deformation Theory of Dynamic Link Matching." Neural Computation 10, no. 3 (April 1, 1998): 651–69. http://dx.doi.org/10.1162/089976698300017692.

Full text
Abstract:
Dynamic link matching is a self-organizing topographic mapping between a template image and a data image. The mapping tends to be continuous, linking two points sharing similar local features, which, as a result, can lead to its deformation to some degree. In analyzing such deformation mathematically, we reduced the model equation to a phase equation, which enabled us to clarify the principles of the deformation process and the relationship between high-dimensional models and low-dimensional ones. We also elucidated the characteristics of the model in the context of the standard regularization theory.
APA, Harvard, Vancouver, ISO, and other styles
30

Bayat, Siavash, Yonghui Li, Lingyang Song, and Zhu Han. "Matching Theory: Applications in wireless communications." IEEE Signal Processing Magazine 33, no. 6 (November 2016): 103–22. http://dx.doi.org/10.1109/msp.2016.2598848.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Afonin, S. S., A. A. Andrianov, V. A. Andrianov, and D. Espriu. "Matching Regge Theory to the OPE." Nuclear Physics B - Proceedings Supplements 164 (February 2007): 296–99. http://dx.doi.org/10.1016/j.nuclphysbps.2006.11.050.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Laurents, Douglas V., and Robert L. Baldwin. "Protein Folding: Matching Theory and Experiment." Biophysical Journal 75, no. 1 (July 1998): 428–34. http://dx.doi.org/10.1016/s0006-3495(98)77530-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Aldred, R. E. L., and Michael D. Plummer. "Extendability and Criticality in Matching Theory." Graphs and Combinatorics 36, no. 3 (February 13, 2020): 573–89. http://dx.doi.org/10.1007/s00373-020-02139-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

McDowell, J. J. "Matching Theory in Natural Human Environments." Behavior Analyst 11, no. 2 (October 1988): 95–109. http://dx.doi.org/10.1007/bf03392462.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

McDowell, J. J. "Two Modern Developments in Matching Theory." Behavior Analyst 12, no. 2 (October 1989): 153–66. http://dx.doi.org/10.1007/bf03392492.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Kominers, Scott Duke, and Tayfun Sönmez. "Matching with slot-specific priorities: Theory." Theoretical Economics 11, no. 2 (May 2016): 683–710. http://dx.doi.org/10.3982/te1839.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Keevash, Peter, and Richard Mycroft. "A geometric theory for hypergraph matching." Memoirs of the American Mathematical Society 233, no. 1098 (January 2015): 0. http://dx.doi.org/10.1090/memo/1098.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Corelli, P., G. Della Giusta, and V. Roberto. "Introductory holography - matching theory and experiment." Physics Education 21, no. 6 (November 1, 1986): 375–77. http://dx.doi.org/10.1088/0031-9120/21/6/413.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

hechter, Roberta Ann. "Matching Clinical Theory with Patient Need." Journal of Analytic Social Work 1, no. 1 (October 9, 1992): 105–11. http://dx.doi.org/10.1080/10529950.1993.10523290.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Keller, André A. "Matching Theory and Economic Model Building." Electronic Notes in Discrete Mathematics 27 (October 2006): 57–58. http://dx.doi.org/10.1016/j.endm.2006.08.054.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Trochim, William M. K. "Outcome pattern matching and program theory." Evaluation and Program Planning 12, no. 4 (January 1989): 355–66. http://dx.doi.org/10.1016/0149-7189(89)90052-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Rhyne, Russell. "A context-matching theory of choosing." Futures 27, no. 3 (April 1995): 311–23. http://dx.doi.org/10.1016/0016-3287(95)00003-f.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Aliabadi, Mohsen, Majid Hadian, and Amir Jafari. "On matching property for groups and field extensions." Journal of Algebra and Its Applications 15, no. 01 (September 7, 2015): 1650011. http://dx.doi.org/10.1142/s0219498816500110.

Full text
Abstract:
In this paper we prove a sufficient condition for the existence of matchings in arbitrary groups and its linear analogue, which lead to some generalizations of the existing results in the theory of matchings in groups and central extensions of division rings. We introduce the notion of relative matchings between arrays of elements in groups and use this notion to study the behavior of matchable sets under group homomorphisms. We also present infinite families of prime numbers p such that ℤ/pℤ does not have the acyclic matching property. Finally, we introduce the linear version of acyclic matching property and show that purely transcendental field extensions satisfy this property.
APA, Harvard, Vancouver, ISO, and other styles
44

Zhang, Yi, Xing Gao, and Li Guo. "Matching Rota-Baxter algebras, matching dendriform algebras and matching pre-Lie algebras." Journal of Algebra 552 (June 2020): 134–70. http://dx.doi.org/10.1016/j.jalgebra.2020.02.011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Antler, Yair. "Two-Sided Matching with Endogenous Preferences." American Economic Journal: Microeconomics 7, no. 3 (August 1, 2015): 241–58. http://dx.doi.org/10.1257/mic.20130272.

Full text
Abstract:
We modify the stable matching problem by allowing agents' preferences to depend on the endogenous actions of agents on the other side of the market. Conventional matching theory results break down in the modified setup. In particular, every game that is induced by a stable matching mechanism (e.g., the Gale-Shapley mechanism) may have equilibria that result in matchings that are not stable with respect to the agents' endogenous preferences. However, when the Gale-Shapley mechanism is slightly modified, every equilibrium of its induced game results in a pairwise stable matching with respect to the endogenous preferences as long as they satisfy a natural reciprocity property. (JEL C78, D82)
APA, Harvard, Vancouver, ISO, and other styles
46

Xu, Xia, Huang Jianhua, Zheng Hong, and Tang Ruicong. "An Optimal Stability Matching Algorithm for DAG Blockchain Based on Matching Theory." Chinese Journal of Electronics 30, no. 2 (March 2021): 367–77. http://dx.doi.org/10.1049/cje.2021.01.010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Chen, Shiyu, Xiuxiao Yuan, Wei Yuan, and Yang Cai. "POOR TEXTURAL IMAGE MATCHING BASED ON GRAPH THEORY." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLI-B3 (June 10, 2016): 741–47. http://dx.doi.org/10.5194/isprs-archives-xli-b3-741-2016.

Full text
Abstract:
Image matching lies at the heart of photogrammetry and computer vision. For poor textural images, the matching result is affected by low contrast, repetitive patterns, discontinuity or occlusion, few or homogeneous textures. Recently, graph matching became popular for its integration of geometric and radiometric information. Focused on poor textural image matching problem, it is proposed an edge-weight strategy to improve graph matching algorithm. A series of experiments have been conducted including 4 typical landscapes: Forest, desert, farmland, and urban areas. And it is experimentally found that our new algorithm achieves better performance. Compared to SIFT, doubled corresponding points were acquired, and the overall recall rate reached up to 68%, which verifies the feasibility and effectiveness of the algorithm.
APA, Harvard, Vancouver, ISO, and other styles
48

Chen, Shiyu, Xiuxiao Yuan, Wei Yuan, and Yang Cai. "POOR TEXTURAL IMAGE MATCHING BASED ON GRAPH THEORY." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLI-B3 (June 10, 2016): 741–47. http://dx.doi.org/10.5194/isprsarchives-xli-b3-741-2016.

Full text
Abstract:
Image matching lies at the heart of photogrammetry and computer vision. For poor textural images, the matching result is affected by low contrast, repetitive patterns, discontinuity or occlusion, few or homogeneous textures. Recently, graph matching became popular for its integration of geometric and radiometric information. Focused on poor textural image matching problem, it is proposed an edge-weight strategy to improve graph matching algorithm. A series of experiments have been conducted including 4 typical landscapes: Forest, desert, farmland, and urban areas. And it is experimentally found that our new algorithm achieves better performance. Compared to SIFT, doubled corresponding points were acquired, and the overall recall rate reached up to 68%, which verifies the feasibility and effectiveness of the algorithm.
APA, Harvard, Vancouver, ISO, and other styles
49

Roth, Alvin E., and Elliott Peranson. "The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design." American Economic Review 89, no. 4 (September 1, 1999): 748–80. http://dx.doi.org/10.1257/aer.89.4.748.

Full text
Abstract:
We report on the design of the new clearinghouse adopted by the National Resident Matching Program, which annually fills approximately 20,000 jobs for new physicians. Because the market has complementarities between applicants and between positions, the theory of simple matching markets does not apply directly. However, computational experiments show the theory provides good approximations. Furthermore, the set of stable matchings, and the opportunities for strategic manipulation, are surprisingly small. A new kind of “core convergence” result explains this; that each applicant interviews only a small fraction of available positions is important. We also describe engineering aspects of the design process. (JEL C78, B41, J44)
APA, Harvard, Vancouver, ISO, and other styles
50

Boehmer, Niclas, Klaus Heeger, and Rolf Niedermeier. "Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 5 (June 28, 2022): 4851–58. http://dx.doi.org/10.1609/aaai.v36i5.20413.

Full text
Abstract:
Following up on purely theoretical work, we contribute further theoretical insights into adapting stable two-sided matchings to change. Moreover, we perform extensive empirical studies hinting at numerous practically useful properties. Our theoretical extensions include the study of new problems (that is, incremental variants of Almost Stable Marriage and Hospital Residents), focusing on their (parameterized) computational complexity and the equivalence of various change types (thus simplifying algorithmic and complexity-theoretic studies for various natural change scenarios). Our experimental findings reveal, for instance, that allowing the new matching to be blocked by a few pairs significantly decreases the difference between the old and the new matching.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Matching theory' for other source types:
Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography