El problema de los matrimonios estables con información incompleta.
After a brief introduction to the Stable Marriage Problem (SMP) and to some known algorithms and results, we define the SMP with incomplete information G(c). We show that it can be turned into an equivalent problem G'(c=1) with complete information. This equivalence will be used to derive an analyti...
| Published in: | Revista Cubana de Física Vol. 23; no. 2; pp. 80 - 86 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Published: |
Universidad de La Habana
2006
|
| Subjects: | |
| Online Access: | View this record in EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=lth&AN=43453623&site=ehost-live header: @attributes: shortDbName: lth uiTerm: 43453623 longDbName: MedicLatina uiTag: AN controlInfo: bkinfo: jinfo: jid: 02539268 UEW jtl: Revista Cubana de Física issn: 02539268 maglogo: N pubinfo: dt: 2006 vid: 23 iid: 2 pid: 21208 pub: Universidad de La Habana artinfo: ui: 43453623 ppf: 80 ppct: 6 formats: fmt: @attributes: type: P size: 174KB tig: atl: El problema de los matrimonios estables con información incompleta. aug: au: Lage, Alejandro Mulet, Roberto affil: Depto. Física Teórica, Facultad de Física, Universidad de la Habana Cátedra de Sistemas Complejos Henri Poincaré, San Lázaro y L, Ciudad de la Habana, Cuba su: Marriage theorem Algorithm research Probability theory Mathematical models Mathematical variables sug: subj: Marriage theorem Algorithm research Probability theory Mathematical models Mathematical variables keyword: Game theory 02.50.Le. Social systems 89.65.-s ab: After a brief introduction to the Stable Marriage Problem (SMP) and to some known algorithms and results, we define the SMP with incomplete information G(c). We show that it can be turned into an equivalent problem G'(c=1) with complete information. This equivalence will be used to derive an analytic expression for the probability of having at least one stable state where every player is married in the incomplete information game G(c). The range of connectivities (…1] defines the games with incomplete information where it is reasonable to look for a stable state where every player is married. An analytic expression is given for . Se presenta el Problema de los Matrimonios junto a algunos resultados y algoritmos. Se define el problema con información incompleta G(c) y se demuestran algunos teoremas que lo hacen equivalente a un problema con P( c ) e s información incompleta G'(c=1). Basados en eso calculamos la probabilidad de encontrar al menos un estado estable en el que todos los jugadores estén casados en G(c). Se calcula la conectividad critica que define el rango …1] de conectividades en las que es posible asignar matrimonios de forma estable a todos los jugadores. pubtype: Academic Journal doctype: Article src: R language: Spanish refInfo: copyright: @attributes: flag: Y custom: Copyright of Revista Cubana de Física is the property of Universidad de La Habana and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. item: Revista Cubana de Física holder: Universidad de La Habana dt: @attributes: year: 2006 holdings: @attributes: islocal: N |
|---|