Stable two-sided matching of slot allocation in airport collaborative decision making (2015)
- Authors:
- Autor USP: LAGO, ALAIR PEREIRA DO - IME
- Unidade: IME
- DOI: 10.1007/978-3-319-21009-4_23
- Subjects: TEORIA DOS JOGOS; TOMADA DE DECISÃO EM GRUPO; AVIAÇÃO; AEROPORTOS
- Keywords: deferred acceptance; manipulation
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Proceedings
- Conference titles: International Conference on Knowledge Management in Organizations - KMO
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
SOUZA, Marcio Augusto da Silva e WEIGANG, Li e LAGO, Alair Pereira do. Stable two-sided matching of slot allocation in airport collaborative decision making. 2015, Anais.. Cham: Springer, 2015. Disponível em: https://doi.org/10.1007/978-3-319-21009-4_23. Acesso em: 25 abr. 2024. -
APA
Souza, M. A. da S., Weigang, L., & Lago, A. P. do. (2015). Stable two-sided matching of slot allocation in airport collaborative decision making. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-21009-4_23 -
NLM
Souza MA da S, Weigang L, Lago AP do. Stable two-sided matching of slot allocation in airport collaborative decision making [Internet]. Proceedings. 2015 ;[citado 2024 abr. 25 ] Available from: https://doi.org/10.1007/978-3-319-21009-4_23 -
Vancouver
Souza MA da S, Weigang L, Lago AP do. Stable two-sided matching of slot allocation in airport collaborative decision making [Internet]. Proceedings. 2015 ;[citado 2024 abr. 25 ] Available from: https://doi.org/10.1007/978-3-319-21009-4_23 - Sobre os semigrupos de burnside 'X POT.N'='X POT.N+M'
- On the Burnside semigroups 'x POT.n' ='x POT.n+m'
- Lossless filter for multiple repetitions with Hamming distance
- Maximal groups in free Burnside semigroups
- On the Burnside semigroups xn = xn+m
- A new algorithm for sparse suffix trees
- Comparison with parametric optimization in credit card fraud detection
- Local groups in free groupoids satisfying certain monoid identities
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions
Informações sobre o DOI: 10.1007/978-3-319-21009-4_23 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
