In a decentralized setting the game-theoretical predictions are that only strong blockings are allowed to rupture the structure of a matching. This paper argues that, under indifferences, also weak blockings should be ...

In this paper, we characterize the strongly stable fractional matchings for the marriage model as the union of the convex hull of connected sets of stable matchings. Moreover, we present an algorithm that computes the set ...

A stable matching rule is used as the outcome function for the Admission game where colleges behave straightforwardly and the students` strategies are given by their preferences over the colleges. We show that the ...

Despite the efficacy of minutia-based fingerprint matching techniques for good-quality images captured by optical sensors, minutia-based techniques do not often perform so well on poor-quality images or fingerprint images ...

A characterization is given for graphs whose matching polynomial is the determinant of their matching matrices. The matching matrix is then modified and its relation with other graph polynomials is examined.

A characterization is given for graphs whose matching polynomial is the determinant of their matching matrices. The matching matrix is then modified and its relation with other graph polynomials is examined.

Purpose. This study aimed to investigate the effects of match location, quality of opposition, match outcome, and playing position on internal load (IL), external load (EL), and interpersonal interactions in professional ...