Results 11 to 20 of about 3,739,569 (169)
Extracting Systemic Anticancer Treatment Lines from the Danish National Patient Registry for Solid Tumour Patients Treated in the North Denmark Region Between 2009 and 2019 [PDF]
Clinical EpidemiologyCharles Vesteghem,1,2 Martin Bøgsted,1,2 Deirdre Cronin-Fenton,3 Laurids Østergaard Poulsen2,4 1Center for Clinical Data Science, Aalborg University and Aalborg University Hospital, Aalborg, Denmark; 2Clinical Cancer Research Centre, Aalborg University ...
Vesteghem C +3 more
doaj +2 more sources
Characterization of Dynamics of Stable Matchings: Attractors Mapped from Stable Matchings
Procedia Computer Science, 2013 AbstractThis note characterizes the dynamic structure of stable matchings of the stable marriage problem (SMP). The characterization focuses on the dynamic process of how the stable matching will be attained. To this end, the discrete problem of the SMP will be mapped to nonlinear dynamical models whose attractors include the counterparts of the stable
Yoshiteru Ishida
exaly +2 more sources
International Joint Conference on Autonomous Agents and Multiagent Systems, 2022 Gale and Shapley introduced a matching problem between two sets of agents where each agent on one side has an exogenous preference ordering over the agents on the other side. They defined a matching as stable if no unmatched pair can both improve their utility by forming a new pair.
Felipe Garrido-Lucero, Rida Laraki
openaire +2 more sources
The lattice of worker-quasi-stable matchings [PDF]
Games Econ. Behav., 2021 In a many-to-one matching model, we study the set of worker-quasi-stable matchings when firms’ preferences satisfy substitutability. Worker-quasi-stability is a relaxation of stability that allows blocking pairs involving a firm and an unemployed worker.
Agustín G. Bonifacio +4 more
semanticscholar +1 more source
Stability and Median Rationalizability for Aggregate Matchings
Games, 2021 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 ...
Federico Echenique +3 more
doaj +1 more source
Affinely representable lattices, stable matchings, and choice functions [PDF]
Mathematical programming, 2020 Birkhoff’s representation theorem (Birkhoff, Duke Math J 3(3):443–454, 1937) defines a bijection between elements of a distributive lattice and the family of upper sets of an associated poset.
Yuri Faenza, Xuan Zhang
semanticscholar +1 more source
Stable Matchings with Restricted Preferences: Structure and Complexity [PDF]
ACM Conference on Economics and Computation, 2020 It is well known that every stable matching instance I has a rotation poset R(I) that can be computed efficiently and the downsets of R(I) are in one-to-one correspondence with the stable matchings of I.
Christine T. Cheng, Will Rosenbaum
semanticscholar +1 more source
Games, 2021 We introduce a new class of matching mechanisms—quantile stable mechanisms—that generate stable matchings that can be seen as a compromise between sides of a two-sided market.
Peter Chen +3 more
doaj +1 more source
On the Stable Matchings That Can Be Reached When the Agents Go Marching in One By One
SIAM Journal on Discrete Mathematics, 2016 Christine T. Cheng
exaly +2 more sources
Fractionally log-concave and sector-stable polynomials: counting planar matchings and more [PDF]
Symposium on the Theory of Computing, 2021 We show fully polynomial time randomized approximation schemes (FPRAS) for counting matchings of a given size, or more generally sampling/counting monomer-dimer systems in planar, not-necessarily-bipartite, graphs.
Yeganeh Alimohammadi +3 more
semanticscholar +1 more source