Prices of anarchy of selfish 2D bin packing games (2019)
- Authors:
- USP affiliated authors: FERNANDES, CRISTINA GOMES - IME ; FERREIRA, CARLOS EDUARDO - IME ; WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1142/s0129054119500096
- Assunto: TEORIA DOS JOGOS
- Keywords: Selfish bin packing; square packing; rectangle packing; Nash equilibrium; strong Nash equilibrium; price of anarchy
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: International Journal of Foundations of Computer Science
- ISSN: 0129-0541
- Volume/Número/Paginação/Ano: v. 30, n. 03, p. 355-374, 2019
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
FERNANDES, Cristina Gomes et al. Prices of anarchy of selfish 2D bin packing games. International Journal of Foundations of Computer Science, v. 30, n. 03, p. 355-374, 2019Tradução . . Disponível em: https://doi.org/10.1142/s0129054119500096. Acesso em: 22 jan. 2026. -
APA
Fernandes, C. G., Ferreira, C. E., Miyazawa, F. K., & Wakabayashi, Y. (2019). Prices of anarchy of selfish 2D bin packing games. International Journal of Foundations of Computer Science, 30( 03), 355-374. doi:10.1142/s0129054119500096 -
NLM
Fernandes CG, Ferreira CE, Miyazawa FK, Wakabayashi Y. Prices of anarchy of selfish 2D bin packing games [Internet]. International Journal of Foundations of Computer Science. 2019 ; 30( 03): 355-374.[citado 2026 jan. 22 ] Available from: https://doi.org/10.1142/s0129054119500096 -
Vancouver
Fernandes CG, Ferreira CE, Miyazawa FK, Wakabayashi Y. Prices of anarchy of selfish 2D bin packing games [Internet]. International Journal of Foundations of Computer Science. 2019 ; 30( 03): 355-374.[citado 2026 jan. 22 ] Available from: https://doi.org/10.1142/s0129054119500096 - Selfish square packing
- Repetition-free longest common subsequence
- A polyhedral investigation of the LCS problem and a repetition-free variant
- Repetition-free longest common subsequence
- The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
- The envy-free pricing problem and unit-demand markets
- Rearrangement of DNA fragments: a branch-and-cut algorithms
- A polyhedral approach for DNA fragments rearrangement
- Planos de corte e a resolução de problemas de otimização combinatória
- Reconstruction of DNA fragments: a graph model
Informações sobre o DOI: 10.1142/s0129054119500096 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2964295.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
