Filters








2,211,285 Hits in 3.5 sec

On optimal worst-case matching

Cheng Long, Raymond Chi-Wing Wong, Philip S. Yu, Minhao Jiang
2013 Proceedings of the 2013 international conference on Management of data - SIGMOD '13  
In this paper, we propose a new problem called SPatial Matching for Minimizing Maximum matching distance (SPM-MM). Then, we design two algorithms for SPM-MM, Threshold-Adapt and Swap-Chain.  ...  In order to address this issue, some spatial matching problems have been proposed, which, however, cannot be used for some real-life applications like emergency facility allocation where the maximum matching  ...  Acknowledgements: We are grateful to the anonymous reviews for their valuable comments on this paper.  ... 
doi:10.1145/2463676.2465321 dblp:conf/sigmod/LongWYJ13 fatcat:xjw322pmdjbslm6gjtubokhlci

Necessarily Optimal One-Sided Matchings [article]

Hadi Hosseini, Vijay Menon, Nisarg Shah, Sujoy Sikdar
2021 arXiv   pre-print
We focus on two popular desiderata from the matching literature: Pareto optimality and rank-maximality.  ...  Instead of asking the agents to report their complete preferences, our goal is to learn a desirable matching from partial preferences, specifically a matching that is necessarily Pareto optimal (NPO) or  ...  Necessarily Pareto optimal matchings In this section, we investigate necessarily Pareto optimal (NPO) matchings.  ... 
arXiv:2007.09079v3 fatcat:7ytvobhxkbeojgtaddq5gsnd7y

Necessarily Optimal One-Sided Matchings

Hadi Hosseini, Vijay Menon, Nisarg Shah, Sujoy Sikdar
2021 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We focus on two popular desiderata from the matching literature: Pareto optimality and rank-maximality.  ...  Instead of asking the agents to report their complete preferences, our goal is to learn a desirable matching from partial preferences, specifically a matching that is necessarily Pareto optimal (NPO) or  ...  . , R n ), a matching M is said to be Pareto optimal w.r.t.  ... 
doi:10.1609/aaai.v35i6.16690 fatcat:fm6uf7haefag7mdqb74qgxa2vu

On Computing an Optimal Semi-matching [chapter]

František Galčík, Ján Katrenič, Gabriel Semanišin
2011 Lecture Notes in Computer Science  
Semanišin On computing an optimal semi-matching Conclusion algorithm for computing an optimal semi-matching in time O(n ω ) with high probability since ω ≤ 2.38, this algorithms breaks through O(n 2.5  ...  Previous work Algorithms for computing an optimal semi-matchings: Algorithms are based on finding (cost-reducing) alternating paths with some properties.  ... 
doi:10.1007/978-3-642-25870-1_23 fatcat:jplee2l5dvfgjntu2ksdpotz6e

Designing Approximately Optimal Search on Matching Platforms [article]

Nicole Immorlica, Brendan Lucier, Vahideh Manshadi, Alexander Wei
2021 arXiv   pre-print
We study the design of a decentralized two-sided matching market in which agents' search is guided by the platform.  ...  Focusing on symmetric pairwise preferences in a continuum model, we first characterize the unique stationary equilibrium that arises given a feasible set of meeting rates.  ...  This is because whenever two agents of types m and w match at a certain rate, it is optimal for the matches realized to be the highest-valued ones.  ... 
arXiv:2102.09017v2 fatcat:7bq7rj2pwrhtbjky6qgjdwis3q

On optimal matching measures for matching problems related to the Euclidean distance

José Manuel Mazón, Julio Daniel Rossi, Julián Toledo
2014 Mathematica Bohemica  
optimal matching measures µ n (which are supported on ∂Ω).  ...  as p → ∞. ⊲ One can always obtain a solution of the optimal matching problem with a matching measure supported on the boundary of the target set.  ... 
doi:10.21136/mb.2014.144132 fatcat:ly65vrb335bmliy6pu326tityq

AUPCR Maximizing Matchings : Towards a Pragmatic Notion of Optimality for One-Sided Preference Matchings [article]

Girish Raguvir J, Rahul Ramesh, Sachin Sridhar, Vignesh Manoharan
2017 arXiv   pre-print
Finally, we illustrate the superiority of the AUPCR-maximizing matching by comparing its performance against other optimal matchings on synthetic instances modeling real-world data.  ...  We consider the problem of computing a matching in a bipartite graph in the presence of one-sided preferences.  ...  Is an AMM Pareto optimal? Yes, AMM is a Pareto optimal matching. Theorem. AUPCR maximizing matching is Pareto optimal. Proof.  ... 
arXiv:1711.09564v2 fatcat:bzgehpfbmbfclgl7w43dwbyqve

Designing optimal- and fast-on-average pattern matching algorithms [article]

Gilles Didier, Laurent Tichit
2016 arXiv   pre-print
in terms of observed average speed on real data.  ...  Finally, our approaches are compared with 9 pre-existing pattern matching algorithms from both a theoretical and a practical point of view, i.e. both in terms of limit expected speed on iid texts, and  ...  Laurent Tichit collaborated on the software development, ran the tests and wrote the section Evaluation. Both authors read, edited and approved the final manuscript.  ... 
arXiv:1604.08860v4 fatcat:mfyezopwcbbkhkd2wxgvrzjfdu

Some results on the optimal matching problem for the Jacobi model [article]

Jiexiang Zhu
2019 arXiv   pre-print
We establish some exact asymptotic results for a matching problem with respect to a family of beta distributions.  ...  The proofs are based on the recent PDE and mass transportation approach developed by L. Ambrosio, F. Stra and D. Trevisan.  ...  For an extensive discussion of the one-dimensional optimal matching problem, see [7] .  ... 
arXiv:1903.11739v2 fatcat:yshnrqi7lrck5czde5atxobv4a

On optimal matching of Gaussian samples III

Michel Ledoux, Jie-Xiang Zhu
2020 Probability and Mathematical Statistics  
This article is a continuation of the papers [10], [11] in which the optimal matching problem and the related rates of convergence of empirical measures for Gaussian samples are addressed.  ...  The proof relies on the pde and mass transportation approach developed by L. Ambrosio, F. Stra and D. Trevisan in a compact setting.  ...  The optimal matching problem would consist in the study of E[W p p (µ n , ν n )] for two independent samples X 1 , . . . , X n and Y 1 , . . . , Y n with µ n = 1 n n i=1 δ X i and ν n = 1 n n i=1 δ Y i  ... 
doi:10.37190/0208-4147.41.2.3 fatcat:uzlvaodxt5dmniyev76fpn6ciu

On optimal matching of Gaussian samples III [article]

Michel Ledoux, Jie-Xiang Zhu
2019 arXiv   pre-print
This article is a continuation of the papers [8,9] in which the optimal matching problem, and the related rates of convergence of empirical measures for Gaussian samples are addressed.  ...  The proof relies on the pde and mass transportation approach developed by L. Ambrosio, F. Stra and D. Trevisan in a compact setting.  ...  The optimal matching problem would consist in the study of E(W p p (µ n , ν n )) for two independent samples X 1 , . . . , X n and Y 1 , . . . , Y n with µ n = 1 n n i=1 δ X i and ν n = 1 n n i=1 δ Y i  ... 
arXiv:1911.07579v1 fatcat:wed4avgemffw5fkrd5xsedelbu

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

Xia Xu, Huang Jianhua, Zheng Hong, Tang Ruicong
2021 Chinese journal of electronics  
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.  ...  A verification service scheduling system is used to assign transactions to the verifiers and achieve the optimal matching.  ...  The main contributions of this paper are as follows: 1) A DAG blockchain optimal stable matching algorithm based on matching theory is proposed to solve the contradiction between the performance limitations  ... 
doi:10.1049/cje.2021.01.010 fatcat:fvqq4kyfqvelbkx25xenwnca6a

A Unified Optimization View on Generalized Matching Pursuit and Frank-Wolfe [article]

Francesco Locatello, Rajiv Khanna, Michael Tschannen, Martin Jaggi
2017 arXiv   pre-print
In this paper, we take a unified view on both classes of methods, leading to the first explicit convergence rates of matching pursuit methods in an optimization sense, for general sets of atoms.  ...  Two of the most fundamental prototypes of greedy optimization are the matching pursuit and Frank-Wolfe algorithms.  ...  Matching pursuit algorithm variants. We now move on to Algorithm 4 which solves optimization problems over a linear span, as given in (4) .  ... 
arXiv:1702.06457v2 fatcat:lpo4p3aembh63dn73mwszsan7u

On the Hamming distance in combinatorial optimization problems on hypergraph matchings

Alla Kammerdiner, Pavlo A. Krokhmal, Panos M. Pardalos
2010 Optimization Letters  
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems.  ...  For random hypergraph matching problems, an upper bound on the expected Hamming distance to the optimal solution is derived, and an exact expression is obtained in the special case of multidimensional  ...  Depending on the particular form of Φ, a number of combinatorial optimization problems on hypergraph matchings can be formulated.  ... 
doi:10.1007/s11590-010-0187-9 fatcat:ara4wnix65bxfdtojvbx3opbdm

Block matching algorithm based on Harmony Search optimization for motion estimation [article]

Erik Cuevas
2014 arXiv   pre-print
Therefore, BM motion estimation can be viewed as an optimization problem whose goal is to find the best-matching block within a search space.  ...  On the other hand, the Harmony Search (HS) algorithm is a population-based optimization method that is inspired by the music improvisation process in which a musician searches for harmony and continues  ...  The full search algorithm (FSA) [11] is the simplest block-matching algorithm that can deliver the optimal estimation solution regarding a minimal matching error as it checks all candidates one at a  ... 
arXiv:1406.4484v1 fatcat:p5ybswndfbg6vcxd44m3qferbi
« Previous Showing results 1 — 15 out of 2,211,285 results