{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T04:11:28Z","timestamp":1765253488339},"reference-count":20,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2011,2,14]],"date-time":"2011-02-14T00:00:00Z","timestamp":1297641600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2011,5]]},"abstract":"<jats:p>We introduce a discrete random process which we call the passenger model, and show that it is connected to a certain random model of the assignment problem and in particular to the so-called Buck\u2013Chan\u2013Robbins urn process. We propose a conjecture on the distribution of the location of the minimum cost assignment in a cost matrix with zeros at specified positions and remaining entries of exponential distribution. The conjecture is consistent with earlier results on the participation probability of an individual matrix entry. We also use the passenger model to verify a conjecture by V. Dotsenko on the assignment problem.<\/jats:p>","DOI":"10.1017\/s0963548311000022","type":"journal-article","created":{"date-parts":[[2011,2,14]],"date-time":"2011-02-14T09:09:33Z","timestamp":1297674573000},"page":"467-480","source":"Crossref","is-referenced-by-count":1,"title":["The Blind Passenger and the Assignment Problem"],"prefix":"10.1017","volume":"20","author":[{"given":"JOHAN","family":"W\u00c4STLUND","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2011,2,14]]},"reference":[{"key":"S0963548311000022_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-003-0308-9"},{"key":"S0963548311000022_ref12","doi-asserted-by":"crossref","unstructured":"[12] Nair C. (2005) Proofs of the Parisi and Coppersmith\u2013Sorkin conjectures in the random assignment problem. PhD thesis, Stanford.","DOI":"10.1002\/rsa.20084"},{"key":"S0963548311000022_ref7","unstructured":"[7] Hessler M. and W\u00e4stlund J. (2009) LP-relaxed matching with free edges and loops. In \u2018Optimization, matroids and error-correcting codes\u2019, PhD thesis of M. Hessler, Link\u00f6ping, Sweden."},{"key":"S0963548311000022_ref1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.1015"},{"key":"S0963548311000022_ref8","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v15-846"},{"key":"S0963548311000022_ref15","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20066"},{"key":"S0963548311000022_ref9","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548306007802"},{"key":"S0963548311000022_ref3","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10045"},{"key":"S0963548311000022_ref5","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/33\/10\/305"},{"key":"S0963548311000022_ref18","volume-title":"Proc. Fourth Colloquium on Mathematics and Computer Science, September 2006","author":"W\u00e4stlund","year":"2006"},{"key":"S0963548311000022_ref16","unstructured":"[16] W\u00e4stlund J. (2005) Exact formulas and limits for a class of random optimization problems. Link\u00f6ping Studies in Mathematics no. 5."},{"key":"S0963548311000022_ref17","unstructured":"[17] W\u00e4stlund J. (2005) The variance and higher moments in the random assignment problem. Link\u00f6ping Studies in Mathematics no. 8."},{"key":"S0963548311000022_ref14","unstructured":"[14] Parisi G. (1998) A conjecture on random bipartite matching. arXiv:cond-mat\/9801176."},{"key":"S0963548311000022_ref19","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v14-1475"},{"key":"S0963548311000022_ref11","unstructured":"[11] Linusson S. and W\u00e4stlund J. A generalization of the random assignment problem. arXiv:math.CO\/0006146."},{"key":"S0963548311000022_ref6","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1040.0105"},{"key":"S0963548311000022_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s11511-010-0046-7"},{"key":"S0963548311000022_ref4","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199909)15:2<113::AID-RSA1>3.0.CO;2-S"},{"key":"S0963548311000022_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548302005114"},{"key":"S0963548311000022_ref13","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20084"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548311000022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T08:46:51Z","timestamp":1556354811000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548311000022\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,14]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["S0963548311000022"],"URL":"https:\/\/doi.org\/10.1017\/s0963548311000022","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,14]]}}}