Results 61 to 70 of about 1,556,418 (219)
The Big Match and the Paris Match [PDF]
, 2003 In this paper we discuss the most typical and illustrative examples in stochastic game theory: the big match and a non-zero-sum extension thereof. These big match examples have played key roles in the development of stochastic game theory and we shall therefore examine them in some detail.keywordspure strategystationary strategystochastic gamerepeated ...
openaire +3 more sources
Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, 2009 37 pages; to appear in Annales de l'institut Henri Poincare (B)
Holroyd, Alexander E. +3 more
openaire +4 more sources
Fractional matching preclusion for restricted hypercube-like graphs [PDF]
, 2019 The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is the minimum number of edges whose deletion results in the graph with neither perfect matchings nor almost perfect matchings.
arxiv +1 more source
Large Sample Properties of Matching Estimators for Average Treatment Effects
, 2004 Matching estimators for average treatment effects are widely used in evaluation research despite the fact that their large sample properties have not been established in many cases. The absence of formal results in this area may be partly due to the fact
Alberto Abadie, G. Imbens
semanticscholar +1 more source
Characteristic Evolution and Matching [PDF]
Living Reviews in Relativity, 1998 AbstractI review the development of numerical evolution codes for general relativity based upon the characteristic initial-value problem. Progress in characteristic evolution is traced from the early stage of 1D feasibility studies to 2D-axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to
openaire +23 more sources
Locally Correct Frechet Matchings [PDF]
arXiv, 2012 The Frechet distance is a metric to compare two curves, which is based on monotonous matchings between these curves. We call a matching that results in the Frechet distance a Frechet matching. There are often many different Frechet matchings and not all of these capture the similarity between the curves well.
arxiv
Matching preclusion for $n$-grid graphs [PDF]
, 2016 A matching preclusion set of a graph is an edge set whose deletion results in a graph without perfect matching or almost perfect matching. The Cartesian product of $n$ paths is called an $n$-grid graph. In this paper, we study the matching preclusion problems for $n$-grid graphs and obtain the following results.
arxiv +1 more source
Cell Stem Cell, 2012 It is hard to believe that the International Society for Stem Cell Research (ISSCR) is 10 years old, and that coincident with this is the fifth-year anniversary of Cell Stem Cell. Having participated in the creation and development of the society and the journal, the success of both has made me appreciate my matchmaking skills.When I founded the ISSCR,
openaire +3 more sources
Looking into the black box: a survey of the matching function
, 2001 We survey the microfoundations, empirical evidence and estimation issues underlying the aggregate matching function. Several microeconomic matching mechanisms have been suggested in the literature with some successes but none is generally accepted as ...
Barbara Petrongolo, C. Pissarides
semanticscholar +1 more source
Understanding popular matchings via stable matchings [PDF]
arXiv, 2018 Let $G = (A \cup B, E)$ be an instance of the stable marriage problem with strict preference lists. A matching $M$ is popular in $G$ if $M$ does not lose a head-to-head election against any matching where vertices are voters. Every stable matching is a min-size popular matching; another subclass of popular matchings that always exist and can be easily ...
arxiv