scholarly journals Subjective Homophily and the Fixtures Problem

Games ◽  
2020 ◽  
Vol 11 (1) ◽  
pp. 11
Author(s):  
Joseph E. Duggan
Keyword(s):  
College Admissions ◽  
Stable Matching ◽  
Future Research ◽  
Stable Marriage ◽  
Matching Model ◽  
Stable Roommates Problem ◽  
Special Cases ◽  
Sequential Matching ◽  
Arbitrary Matching

The Stable Fixtures problem (Irving and Scott (2007)) is a generalized matching model that nests the well-known Stable Roommates, Stable Marriage, and College Admissions problems as special cases. This paper extends a result of the Stable Roommates problem to demonstrate that a class of homophilic preferences with an appealing psychological interpretation is sufficient to ensure that starting from an arbitrary matching, a decentralized process of allowing the sequential matching of randomly chosen blocking pairs will converge to a pairwise-stable matching with probability one. Strategic implications of this class of preferences are examined and further possible generalizations and directions for future research are discussed.

Matching with Contracts

2005 ◽  
Vol 95 (4) ◽  
pp. 913-935 ◽  
Author(s):  
John William Hatfield ◽  
Paul R Milgrom
Keyword(s):  
Labor Market ◽  
Large Class ◽  
College Admissions ◽  
Aggregate Demand ◽  
Dominant Strategy ◽  
Matching Model ◽  
Matching Algorithm ◽  
Special Cases ◽  
Package Auctions ◽  
Labor Market Matching

We develop a model of matching with contracts which incorporates, as special cases, the college admissions problem, the Kelso-Crawford labor market matching model, and ascending package auctions. We introduce a new “law of aggregate demand” for the case of discrete heterogeneous workers and show that, when workers are substitutes, this law is satisfied by profit-maximizing firms. When workers are substitutes and the law is satisfied, truthful reporting is a dominant strategy for workers in a worker-offering auction/matching algorithm. We also parameterize a large class of preferences satisfying the two conditions.

Reconceptualizing Leadership From a Neurodiverse Perspective

2021 ◽  
pp. 105960112098729
Author(s):  
Quinetta Roberson ◽  
Narda R. Quigley ◽  
Kamil Vickers ◽  
Isabella Bruck
Keyword(s):  
Pervasive Developmental Disorders ◽  
Developmental Disorders ◽  
Leadership Behavior ◽  
Future Research ◽  
Leadership Studies ◽  
Cognitive Characteristics ◽  
Disability Theory ◽  
Special Cases ◽  
Result Management ◽  
Practical Implications

While scholarship has increased on the topic of neurodiversity in organizations, which refers to individuals with pervasive developmental disorders in the workforce, leadership theory and research has not yet integrated this perspective. Consistent with conventional conceptualizations of disability as an impairment, the few relevant leadership studies tend to approach these differences as special cases, rather than as a population to which theory may be generalized. As a result, management scholars have yet to develop theories and models that are inclusive of neurodiversity. Using the critical disability theory as a lens for reframing assumptions about leadership behavior as described in existing theory and research, we postulate that neurodiversity may serve as a cognitive strength from which leadership derives. We offer a conceptual model that articulates how cognitive characteristics associated with neurodiversity may lead to task-based leadership behavior, and we trace the influence of such behaviors on leader and follower outcomes. The model also includes enabling conditions that may positively influence the emergence and recognition of neurodiverse individuals as leaders. We conclude by proposing directions for future research to better integrate the neurodiversity and leadership literatures and reflecting on the associated practical implications.

scholarly journals Adapting Stable Matchings to Evolving Preferences

2020 ◽  
Vol 34 (02) ◽  
pp. 1830-1837 ◽  
Author(s):  
Robert Bredereck ◽  
Jiehua Chen ◽  
Dušan Knop ◽  
Junjie Luo ◽  
Rolf Niedermeier
Keyword(s):  
Computational Complexity ◽  
Computational Cost ◽  
Modern Society ◽  
Stable Matching ◽  
Stable Marriage ◽  
Fixed Parameter Tractability ◽  
Stable Matchings ◽  
Changing Environments ◽  
Fixed Parameter ◽  
Comprehensive Picture

Adaptivity to changing environments and constraints is key to success in modern society. We address this by proposing “incrementalized versions” of Stable Marriage and Stable Roommates. That is, we try to answer the following question: for both problems, what is the computational cost of adapting an existing stable matching after some of the preferences of the agents have changed. While doing so, we also model the constraint that the new stable matching shall be not too different from the old one. After formalizing these incremental versions, we provide a fairly comprehensive picture of the computational complexity landscape of Incremental Stable Marriage and Incremental Stable Roommates. To this end, we exploit the parameters “degree of change” both in the input (difference between old and new preference profile) and in the output (difference between old and new stable matching). We obtain both hardness and tractability results, in particular showing a fixed-parameter tractability result with respect to the parameter “distance between old and new stable matching”.

scholarly journals Drones in manufacturing: exploring opportunities for research and practice

2019 ◽  
Vol 31 (6) ◽  
pp. 1237-1259 ◽  
Author(s):  
Omid Maghazei ◽  
Torbjørn Netland
Keyword(s):  
Research Agenda ◽  
Technology Development ◽  
Future Research ◽  
Related Services ◽  
Content Type ◽  
Behavioral Operations ◽  
Sense Data ◽  
Special Cases ◽  
Potential Applications ◽  
Manufacturing Technologies

Purpose Although the industrial application of drones is increasing quickly, there is a scarcity of applications in manufacturing. The purpose of this paper is to explore current and potential applications of drones in manufacturing, examine the opportunities and challenges involved and propose a research agenda. Design/methodology/approach The paper reports the result of an extensive qualitative investigation into an emerging phenomenon. The authors build on the literature on advanced manufacturing technologies. Data collected through in-depth interviews with 66 drone experts from 56 drone vendors and related services are analyzed using an inductive research design. Findings Drones represent a promising AMT that is expected to be used in several applications in manufacturing in the next few years. This paper proposes a typology of drone applications in manufacturing, explains opportunities and challenges involved and develops a research agenda. The typology categorizes four types of applications based on the drones’ capabilities to “see,” “sense,” “move” and “transform.” Research limitations/implications The proposed research agenda offers a guide for future research on drones in manufacturing. There are many research opportunities in the domains of industrial engineering, technology development and behavioral operations. Practical implications Guidance on current and promising potentials of drones in manufacturing is provided to practitioners. Particularly interesting applications are those that help manufacturers “see” and “sense” data in their factories. Applications that “move” or “transform” objects are scarcer, and they make sense only in special cases in very large manufacturing facilities. Originality/value The application of drones in manufacturing is in its infancy, but is foreseen to grow rapidly over the next decade. This paper presents the first academically rigorous analysis of potential applications of drones in manufacturing. An original and theory-informed typology for drone applications is a timely contribution to the nascent literature. The research agenda presented assists the establishment of a new stream of literature on drones in manufacturing.

Unexpected Plural Inflections in Spanish: Reduplication and Metathesis

2005 ◽  
Vol 36 (2) ◽  
pp. 195-222 ◽  
Author(s):  
James Harris ◽  
Morris Halle
Keyword(s):  
Recent Work ◽  
General Framework ◽  
Future Research ◽  
Special Cases ◽  
Spanish Dialects

We examine the puzzling displacement in various Spanish dialects of a plural suffix from a verb where it is motivated semantically, syntactically, and morphologically onto a following clitic. We present previously unreported data and a new analysis of this material that succeeds where earlier efforts fail to provide a unified account of related phenomena. Our solution, which employs recent work on reduplication and metathesis, allows us to account for seemingly disparate phenomena as special cases of a single general framework and demonstrates that these operations are more versatile than previously thought. Directions for future research are indicated.

On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm

1993 ◽  
Vol 2 (1) ◽  
pp. 53-92 ◽  
Author(s):  
Boris Pittel
Keyword(s):  
Stable Matching ◽  
Second Phase ◽  
Two Phase ◽  
Ranking System ◽  
Stable Roommates Problem ◽  
Stable Marriages ◽  
Problem Instances ◽  
The Individual

In a set of even cardinality n, each member ranks all the others in order of preference. A stable matching is a partition of the set into n/2 pairs, with the property that no two unpaired members both prefer each other to their partners under matching. It is known that for some problem instances no stable matching exists. In 1985, Irving found an O(n2) two-phase algorithm that would determine, for any instance, whether a stable matching exists, and if so, would find such a matching. Recently, Tan proved that Irving's algorithm, with a modified second phase, always finds a stable cyclic partition of the members set, which is a stable matching when each cycle has length two. In this paper we study a likely behavior of the algorithm under the assumption that an instance of the ranking system is chosen uniformly at random. We prove that the likely number of basic steps, i.e. the individual proposals in the first phase and the rotation eliminations, involving subsets of members in the second phase, is O(n log n), and that the likely size of a rotation is O((n log n)1/2). We establish a ‘hyperbola law’ analogous to our past result on stable marriages. It states that at every step of the second phase, the product of the rank of proposers and the rank of proposal holders is asymptotic, in probability, to n3. We show that every stable cyclic partition is likely to be almost a stable matching, in the sense that at most O((n log n)1/2) members can be involved in the cycles of length three or more.

scholarly journals Finding Robust Solutions to Stable Marriage

2017 ◽  
Author(s):  
Begum Genc ◽  
Mohamed Siala ◽  
Barry O'Sullivan ◽  
Gilles Simonin
Keyword(s):  
Local Search ◽  
Programming Model ◽  
Empirical Evaluation ◽  
Stable Matching ◽  
The Other ◽  
Stable Marriage ◽  
Matching Problems ◽  
Robust Solutions ◽  
Constraint Programming Model ◽  
Search Approach

We study the notion of robustness in stable matching problems. We first define robustness by introducing (a,b)-supermatches. An (a,b)-supermatch is a stable matching in which if a pairs break up it is possible to find another stable matching by changing the partners of those a pairs and at most b other pairs. In this context, we define the most robust stable matching as a (1,b)-supermatch where b is minimum. We show that checking whether a given stable matching is a (1,b)-supermatch can be done in polynomial time. Next, we use this procedure to design a constraint programming model, a local search approach, and a genetic algorithm to find the most robust stable matching. Our empirical evaluation on large instances show that local search outperforms the other approaches.

scholarly journals Pairwise Stable Matching in Large Economies

Econometrica ◽  
2021 ◽  
Vol 89 (6) ◽  
pp. 2929-2974 ◽  
Author(s):  
Michael Greinecker ◽  
Christopher Kah
Keyword(s):  
General Class ◽  
Stable Matching ◽  
High Dimensional ◽  
Transferable Utility ◽  
Stable Matchings ◽  
Matching Problems ◽  
Joint Distributions ◽  
Special Cases ◽  
Matching Models ◽  
Stability Notions

We formulate a stability notion for two‐sided pairwise matching problems with individually insignificant agents in distributional form. Matchings are formulated as joint distributions over the characteristics of the populations to be matched. Spaces of characteristics can be high‐dimensional and need not be compact. Stable matchings exist with and without transfers, and stable matchings correspond precisely to limits of stable matchings for finite‐agent models. We can embed existing continuum matching models and stability notions with transferable utility as special cases of our model and stability notion. In contrast to finite‐agent matching models, stable matchings exist under a general class of externalities.

Sign in / Sign up

Export Citation Format

Share Document