Stable Matching Research Articles

A Package-Cognizant CMOS On-Chip Antenna for 2.4 GHz Free-Space and Implantable Applications

A 2.4 GHz industrial, scientific, and medical band on-chip antenna (OCA) is integrated into an on-chip broadband balun in <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$0.18~\mu \text{m}$ </tex-math></inline-formula> CMOS technology on a die of size 4 mm <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> . Antenna miniaturization is achieved from the capacitive loading of meandered dipole arms. A back-to-back configuration of the balun on a separate die is characterized with in-band insertion and return loss of better than 0.9 dB and 20 dB, respectively. A commercial low-cost package is used to provide a decoupling effect to the OCA when immersed in tissue, enabling it to maintain stable impedance matching as in the air. A detailed explanation of the decoupling mechanism is provided using field plots and equivalent circuit analysis. The OCA is characterized in air and different tissue phantoms with a gain of −23.8 dBi in air and −25.9 dBi inside skin mimicking gel. The maximum simulated uplink specific absorption rate is obtained as 160 <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mu \text{W}$ </tex-math></inline-formula> /kg for an input power of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$25~\mu \text{W}$ </tex-math></inline-formula> to the OCA in the transmitting mode. As the antenna has a small footprint and is analytically estimated to be capable of communicating at a high uplink bit rate of 1 Mb/s over a distance of 5.2 m with a 3 dB link margin, it is most suited as a minimally invasive implantable medical device.

The Spillover Effect of the Elder Sibling Going to College on the Younger Sibling’s Access to Higher Education

The interaction among siblings has played an important role in obtaining access to education for individuals. In the background of the universal two-child policy, it will undoubtedly come to the conclusion that having a second child is not conducive to children’s education, judging from the resource dilution effect. However, education, as a result of the joint influence of family, school and society, is naturally affected by the interaction among people. As the most direct and lasting interpersonal bond in the family system, siblings are closely related to individual education acquisition. In fact, due to the rapid change of knowledge between generations, the study of individuals is often carried out through siblings’ counseling or social training institutions, rather than through continuous counseling by parents. One question arises: To what extent is individual’s education affected by the interaction among siblings within the family? More specifically, how does the elder sibling going to college affect the younger sibling’ s access to higher education?Based on the two-wave data of Chinese Household Income Project（CHIP）in 2013 and 2018, this paper evaluates the impact of the elder sibling going to college on the younger sibling’s access to higher education. This paper finds that: （1）The elder sibling going to college has a significant positive impact on the younger sibling’ s access to higher education, and the impact is stronger in two-child families and urban families, showing an educational spillover effect among siblings.（2）The spillover effect is related to the sibling structure and family factors. Specifically, it will be stronger when the elder sibling is the eldest, they have the same gender, and their age gap is 4-6 years. And marriage breakdown and parent-child interaction will also affect it to a certain extent.（3）A further analysis of potential mechanisms reveals that the knowledge transfer and role model effects from the elder sibling to the younger sibling perform certain key functions.（4）The spillover effect could also be further transmitted to the younger sibling’s employment. The individual with an elder sibling going to college is more likely to get a job and participate in state-owned departments.The conclusions of this paper reveal that the elder sibling going to college not only has great contribution to their own development, but also makes the younger sibling benefit from it, which provide a new perspective for understanding the universal two-child policy. Therefore, it is crucial to pay attention to education, especially the education of the elder sibling. It is not an appropriate choice for the elder sibling to end their studies and then take part in the labor market early. In terms of policy implications, on the one hand, we should take a comprehensive assessment about having a second child on the family, not only the resource dilution effect, but also the positive impact of the interaction among siblings such as companions, mutual aids and partners of supporting parents. On the other hand, the formulation of policies to promote fertility desire for two-child needs to consider the issue of“birth choice”. And the family with stable marriage, parent-child interaction, and an elder child of moderate age may be more suitable as incentive targets.

The Protection of Celebrity Name in China: After the ‘乔丹’ Case by the SPC of China

The Supreme People’s Court (SPC) case of ‘乔丹’, brought by Michael Jordan against Qiaodan Sports, is a landmark case over the protection of the right to the personal name in the People’s Republic of China (PRC). In the retrial proceeding, the SPC gave eight exhaustive explanations to the disputed questions and eventually reversed the lower court’s decision. After studying the judgment, this article finds that a famous foreign name can be protected by Chinese Trademark law only when it satisfies three conditions: First, the specified name enjoys a certain popularity in China and is well-known to the concerned public; second, the concerned public uses the specified name to refer to the original person of that name; and third, there has already been a stable match between the specific name and the original person of that name. Although China mainly adopts the “right to name” for the legal protection of celebrity names, the right to name is a kind of personal right, difficult to protect economic benefits derived from celebrities’ names fully. Comparing Germany’s extended protection model of personality rights and the United States model of “right of publicity,” this article suggested that China tries to introduce the United States model to protect the celebrity name’s right.

Efficiency, stability, and commitment in senior level job matching markets

We propose a senior level job matching model with multiple heterogeneous incumbents and entrants. An agent (firm or worker) can be committed or uncommitted (i.e., free). A committed agent is bound by her commitment and cannot unilaterally dissolve her partnership unless her partner agrees to do so. A free agent can make decisions independently. Every agent has preferences over multiple contracts and tries to find her best possible partner with a contract. We examine the problem of how to match workers and firms as well as possible and to set free as many committed agents as possible without violating any commitment. We show the existence of stable and (strict) core matchings through our designed market mechanism and obtain a lattice result for such outcomes and incentive compatibility results for the mechanism.

Matching for Strategic Organizations: Theory and Empirics from Internal Labor Markets

Organizations have recently embraced the tools of market design to address job assignment and internal mobility problems. However, matching objectives within an organization are distinct from those in other settings. We model firm-optimal job assignments and the tradeoffs of using different matching institutions. Our results illuminate where preference-respecting mechanisms (such as those developed for stable matching) perform well for organizational purposes. We then turn to a large organization's internal labor market for empirics. We find that optimal matching is highly productive. Using the organization's preferred metric, the optimal match is 36% more productive than randomly assigned matches within job categories. However, it achieves this through negative assortative matching, placing a majority of workers and managers with assignments they did not rank. By contrast, preference-based matches (using deferred acceptance) are much less productive. They are only 3% more valuable to the firm than the average random match, 24% less than the firm's optimal, and feature positive assortative matching. However, workers and managers are significantly more likely to be assigned to a preferred partner; only 25% are assigned to a match they did not rank.

A Stable Matching Game for V2V Energy Sharing–A User Satisfaction Framework

Electric Vehicles (EVs) are being widely adopted to completely replace vehicles with internal combustion engines. However, the development of charging infrastructure to support the growing number of EVs has been lacking primarily due to the high cost of installation. Additionally, the immature and non-uniform deployment of charging stations has led to the absence of charging infrastructure in areas such as highways and rural areas. As a result, emerging concepts such as, EV-to-Home (V2H), EV-to-Grid (V2G) and EV-to-EV (V2V) charging have gained prominence. In this paper, the V2V energy sharing concept is exploited, where an intelligent and comprehensive framework to manage and allocate energy between EVs is proposed. This work presents a realistic modeling of the V2V energy sharing problem and proposes a two-layer matching approach that can efficiently match the EVs. The proposed approach not only optimizes the cost, but also the time, system energy efficiency, user satisfaction, and social welfare; hence making the approach more realistic and inclusive. Gale-Shapley is utilized to produce stable matchings, in the first layer, whereas a user-satisfaction model is devised to ensure realistic matchings, in the second layer. Additionally, a real-life dataset is developed from commercially available EVs and the performance of the system is evaluated using this dataset, in addition to realistic parameters derived from real-life data. The proposed approach is compared with a benchmark, where the results show that efficient, realistic, and effective V2V matches are achievable, paving the way for the adoption of such framework.

Competition-Congestion-Aware Stable Worker-Task Matching in Mobile Crowd Sensing

Mobile Crowd Sensing is an emerging sensing paradigm that employs massive number of workers' mobile devices to realize data collection. Unlike most task allocation mechanisms that aim at optimizing the global system performance, stable matching considers workers are selfish and rational individuals, which has become a hotspot in MCS. However, existing stable matching mechanisms lack deep consideration regarding the effects of workers' competition phenomena and complex behaviors. To address the above issues, this paper investigates the competition-congestion-aware stable matching problem as a multi-objective optimization task allocation problem considering the competition of workers for tasks. First, a worker decision game based on congestion game theory is designed to assist workers in making decisions, which avoids fierce competition and improves worker satisfaction. On this basis, a stable matching algorithm based on extended deferred acceptance algorithm is designed to make workers and tasks mapping stable, and to construct a shortest task execution route for each worker. Simulation results show that the designed model and algorithm are effective in terms of worker satisfaction and platform benefit.

Stability and Median Rationalizability for Aggregate Matchings

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.

Resource allocation for downlink non-orthogonal multiple access in joint transmission coordinated multi-point networks

Joint transmission coordinated multi-point (JT-CoMP) and non-orthogonal multiple access (NOMA) are key enabling technologies of 5G ubiquitous broadband infrastructures. These technologies are jointly expected to exploit multi-cell and non-orthogonal resource transmissions; thus, conventional resource allocation schemes that only consider either one of them fail to efficiently exploit resources of 5G networks. In this paper, we bridge this gap by proposing a practical and comprehensive joint sub-carrier assignment and power allocation scheme for network sum-rate maximization in JT-CoMP-enabled NOMA networks. We formulate the problem as a mixed integer non-linear programming (MINLP) problem, which is NP-hard. The problem is decoupled into two sub-problems, where the sub-carrier assignment is modeled as a two-sided many-to-many matching game and the power allocation is formulated as a difference of convex (DC) programming problem. The matching algorithm is proved to converge to a two-sided exchange stable matching. Furthermore, the solution computed by the proposed scheme is verified against a baseline solution computed by a commercial optimization package, and has been shown to achieve 91.38% of the baseline solution for JT-CoMP-NOMA networks. Simulation results illustrate that the proposed scheme enhances cell-edge users’ achievable rates by 0.1−27.7% in JT-CoMP-NOMA over conventional NOMA.

Cavity length control for Fourier domain mode locked (FDML) lasers with µm precision.

In highly dispersion compensated Fourier domain mode locked (FDML) lasers, an ultra-low noise operation can only be achieved by extremely precise and stable matching of the filter tuning period and light circulation time in the cavity. We present a robust and high precision closed-loop control algorithm and an actively cavity length controlled FDML laser. The cavity length control achieves a stability of ∼0.18 mHz at a sweep repetition rate of ∼418 kHz which corresponds to a ratio of 4×10-10. Furthermore, we prove that the rapid change of the cavity length has no negative impact on the quality of optical coherence tomography using the FDML laser as light source.

TraCard: A Tool for Smart City Resource Management Based on Novel Framework Algorithm

Background: Fuel is the most important source of energy essential for humanity. It plays a vital role in the economy of a country. Dependency on non-renewable resources like petroleum brings about manipulation of the oil market and an increase in the price of these resources. Excessive use of non-renewable resources leads to global warming. These resources exist in a finite quantity in nature, which makes renewable resources appealing. Objective: Petroleum being a non-renewable energy mode requires monitoring and dynamic pricing based upon the consumption to reduce excessive usage. This dynamic price control on the basis of consumption developed upon the rules of Novel algorithm for resource allocation in the system will orient the end user to move towards developing alternate resources for power generation in the field of renewable energy like wind, hydro, solar, etc. This orientation is one of the key steps for developing a smart city with efficient resource allocation as the key factor of development. Methods: In order to manage resources efficiently, the following processes are incorporated. ➢ Provide End-user a unique ID card (Named as Tra-Card). ➢ Develop data of usage (Fuel, Health Resources, and Supply Chain Management) for initial days. ➢ Automated Management of Resources using Novel Framework Algorithm with fuzzy based stable marriage algorithm). ➢ Develop Customer Management Policy as per the criterion set by governments. ➢ Generate Data and rules for use at individual points of work. Result: The process will help the government make efficient policies and produce real time deliverables over complete control and handling of fuel management; the most important of human life need. This will also allow government’s to provide a solution for end to end charging by making fuel an item of luxury and taxing the people who use it as a luxury product. Discussion: Fuel being primary requisite for human survival needs strict monitoring for irregular usage and laundering. As, the fuel has become an item of luxury for few and item for survival of few “it must be taxed as per the usage” of end-user. The Data is experimental and developed using a multiplication factor α which is multiplied to the base fuel price once it crosses a certain range of Kilometer travelled by the user with his car. Conclusion: The model proposed in the paper captures the necessity of development of an efficient method that considers the finiteness of fossil fuels by monitoring the distribution of fuel and its consumption. The purpose of this project is to save energy with aim of AI Engine managed logistics and goal of creating Energy-Efficient survival of the human species.

Secure communication with joint resource allocation, relay and jammer selection in OFDM‐based cooperative networks

SummaryThis paper considers an orthogonal frequency division multiplexing (OFDM) based cooperative network, where a source node communicates with a destination node with the help of multiple intermediate nodes, in the presence of an eavesdropper. Each intermediate node is assumed to be able to act as a relay or a jammer to improve the physical layer security. The problem of joint subcarrier allocation, power allocation, and mode selection to maximize the sum secrecy rate is investigated. We first reformulate the problem of subcarrier allocation and intermediate node mode selection as a three‐sided matching game and propose an algorithm that achieves a stable matching. Then, the sum secrecy rate is further improved by proposing a heuristic algorithm to switch the modes of the intermediate nodes. Finally, an iterative power allocation algorithm is proposed. It is verified by simulation results that the proposed algorithm outperforms various benchmark algorithms such as the equal subcarrier allocation algorithm, the pure relay selection algorithm, and the random relay selection algorithm, especially when the transmit power limit is high and the number of intermediate nodes is large.

Stability in Matching Markets with Complex Constraints

We develop a model of many-to-one matching markets in which agents with multiunit demand aim to maximize a cardinal linear objective subject to multidimensional knapsack constraints. The choice functions of agents with multiunit demand are therefore not substitutable. As a result, pairwise stable matchings may not exist and even when they do, may be highly inefficient. We provide an algorithm that finds a group-stable matching that approximately satisfies all the multidimensional knapsack constraints. The novel ingredient in our algorithm is a combination of matching with contracts and Scarf’s Lemma. We show that the degree of the constraint violation under our algorithm is proportional to the sparsity of the constraint matrix. The algorithm, therefore, provides practical constraint violation bounds for applications in contexts, such as refugee resettlement, day care allocation, and college admissions with diversity requirements. Simulations using refugee resettlement data show that our approach produces outcomes that are not only more stable, but also more efficient than the outcomes of the Deferred Acceptance algorithm. Moreover, simulations suggest that in practice, constraint violations under our algorithm would be even smaller than the theoretical bounds. This paper was accepted by Gabriel Weintraub, revenue management and market analytics.

Stable image matching for 3D reconstruction in outdoor

SummaryStable image matching is still a pursuit goal in the communities of computer vision and graphics because of many potential applications such as 3D reconstruction, object recognition, and visual tracking. In the case of 3D reconstruction, modern structure‐from‐motion methods depend heavily on image‐matching methods for recovering geometric models. Existing methods have tried to exploit various strategies to generate correct feature correspondences for 3D reconstruction. However, there are no efficient methods that can work well in the wild. To defend this drawback, in this paper, we design a stable image‐matching method for 3D reconstruction. The method consists of feature point detection, descriptor extraction, feature matching, and matching verification. Besides, we try to choose a stable algorithm for each module of the proposed method, in which the adopted algorithms are implemented in an optimized approach for acceleration. Finally, we conduct a systematic experiment on several benchmarking datasets to assess the performance of the proposed method. Experimental results show that the proposed method has both high matching precision and fast speed.

SUCESSÃO NA UNIÃO ESTÁVEL: A INCONSTITUCIONALIDADE DO ARTIGO 1.790 DO CÓDIGO CIVIL

This scientific article aims to demonstrate, through an exploration of the types of family formation in Brazil, the succession rules related to spouses and partners. The discussion consists in the fact that the constitutional legislator has equalized both institutions before the law, attributing to the stable union the position of a family entity, which, mistakenly, is contradicted by the infraconstitutional legislation, regarding, mainly, the regulation of inheritance rights. of companions. Thus, this scientific article will be based on a comparison between the institutes of stable union and marriage, in addition to highlighting doctrinal positions and jurisprudence on the subject, in addition to differentiating each type of family entity. It is common knowledge that there is a hierarchy in the legal system between legal institutes, in which infraconstitutional laws must be in accordance with the Greater Law. However, the Civil Code of 2002 tried to contradict several contemporary constitutional elements of the concept of family, considering that in its article 1790, it regulated the succession of the partner in an unconstitutional way, unfairly supporting the relationships of affection foreseen in the current family. , giving preference to biological ties, contrary to the current understanding of family.

An Optimal Stability Matching Algorithm for DAG Blockchain Based on Matching Theory

IOTA is a typical blockchain designed for IoT applications. The Markov chain monte carlo algorithm (MCMC) used in IOTA may lead to a large number of unverified blocks, which increases transaction delay to a certain extent. We propose a Stable matching algorithm (SMA) based on matching theory to stimulate nodes to verify blocks, thereby reducing the number of unverified blocks and the consensus delay. The structure of our IoT blockchain uses the Directed acyc1ic graph (DAG) to improve the transaction processing capability. The nodes in the network are abstracted as transaction issuers and transaction verifiers. A verification service scheduling system is used to assign transactions to the verifiers and achieve the optimal matching. We designed a trust evaluation mechanism which offers verifiers references and awards to check transactions. The simulation results show that SMA can significantly reduce the number of orphan blocks and improve the transaction throughput, which helps to improve the reliability of the IoT blockchain.

Subgame perfect equilibria under the deferred acceptance algorithm

We analyze a subgame perfect equilibrium (SPE) of an extensive game with perfect information induced by the firm-oriented deferred acceptance (DA) algorithm in a one-to-one matching market between firms and workers. Our game repeats the following procedure until every firm in the market has a partner: (i) an unmatched firm strategically decides to which worker to make an offer or to exit the market, and (ii) the worker receiving the offer strategically decides whether to tentatively accept or reject it. When no agents are strategic, the resulting outcome is the firm-optimal stable matching. We show that the worker-optimal stable matching is the unique SPE outcome when only workers are strategic. By contrast, multiple SPE outcomes may exist, possibly including unstable matchings when only firms are strategic. We show that every firm weakly prefers any SPE outcome to the worker-optimal stable matching and that the matching induced by Kesten’s efficiency-adjusted DA algorithm can be achieved as an SPE. When both workers and firms are strategic, we also show that the worker-optimal stable matching is still the unique SPE outcome.

School choice: Nash implementation of stable matchings through rank-priority mechanisms

We consider school choice problems (Abdulkadiroğlu and Sönmez, 2003) where students are assigned to public schools through a centralized assignment mechanism. We study the family of so-called rank-priority mechanisms, each of which is induced by an order of rank-priority pairs. Following the corresponding order of pairs, at each step a rank-priority mechanism considers a rank-priority pair and matches an available student to an unfilled school if the student and the school rank and prioritize each other in accordance with the rank-priority pair. The Boston or immediate acceptance mechanism is a particular rank-priority mechanism. Our first main result is a characterization of the subfamily of rank-priority mechanisms that Nash implement the set of stable matchings (Theorem 1). Our second main result is a strong impossibility result: under incomplete information, no rank-priority mechanism implements the set of stable matchings (Theorem 2).

Matching with property rights: an application to Korean teacher transfer program

I model a teacher transfer program in South Korea as a matching-with-contracts problem. The current (non-centralized) system allows a teacher wishing to make an inter-state transfer to submit, at most, one application and will approve only a one-to-one exchange. Consequently, not only is this current system unstable and inefficient, but it also does not adequately reflect the teachers’ preferences. In contrast, the centralized mechanism I propose fully represents teachers’ preferences and is less wasteful. One key requirement of a teacher transfer program is that it must protect the rights of currently existing teachers who wish to transfer from their current positions, perhaps to satisfy familial needs, for only a short period of time. However, as I demonstrate, no stable mechanism exists that guarantee protection for the rights of such teachers to the positions they currently occupy. To solve this problem, I introduce a novel concept called a claim contract. A claim contract, in a matching-with-contracts model, protects current teachers by removing contracts that do not match the specified duration set by these teachers from the set of potential matches. In this paper, I propose a new mechanism, based on a claim contract, that is strategy-proof and approximates stable matching.

Popularity, Mixed Matchings, and Self-Duality

Our input instance is a bipartite graph G where each vertex has a preference list ranking its neighbors in a strict order of preference. A matching M is popular if there is no matching N such that the number of vertices that prefer N to M outnumber those that prefer M to N. Each edge is associated with a utility and we consider the problem of matching vertices in a popular and utility-optimal manner. It is known that it is NP-hard to compute a max-utility popular matching. So we consider mixed matchings: a mixed matching is a probability distribution or a lottery over matchings. Our main result is that the popular fractional matching polytope [Formula: see text] G is half-integral and in the special case where a stable matching in G is a perfect matching, this polytope is integral. This implies that there is always a max-utility popular mixed matching which is the average of two integral matchings. So in order to implement a max-utility popular mixed matching in G, we need just a single random bit. We analyze the popular fractional matching polytope whose description may have exponentially many constraints via an extended formulation with a linear number of constraints. The linear program that gives rise to this formulation has an unusual property: self-duality. The self-duality of this LP plays a crucial role in our proof. Our result implies that a max-utility popular half-integral matching in G and also in the roommates problem (where the input graph need not be bipartite) can be computed in polynomial time.