The envy-free pricing problem and unit-demand markets (2014)
- Authors:
- USP affiliated authors: FERNANDES, CRISTINA GOMES - IME ; FERREIRA, CARLOS EDUARDO - IME
- Unidade: IME
- DOI: 10.1007/978-3-319-09174-7_20
- Subjects: OTIMIZAÇÃO COMBINATÓRIA; MATEMÁTICA DA COMPUTAÇÃO; ALGORITMOS; REDES DE COMPUTADORES
- Keywords: pricing problem; envy-free allocations; unit-demand auctions
- Language: Inglês
- Imprenta:
- Source:
- Conference titles: International Symposium on Combinatorial Optimization - ISCO
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
FERNANDES, Cristina Gomes et al. The envy-free pricing problem and unit-demand markets. 2014, Anais.. Cham: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-319-09174-7_20. Acesso em: 19 abr. 2024. -
APA
Fernandes, C. G., Ferreira, C. E., Franco, Á. J. P., & Schouery, R. C. S. (2014). The envy-free pricing problem and unit-demand markets. In Combinatorial optimization: Third International Symposium, ISCO 2014 Lisbon, Portugal, March 5–7, 2014, revised selected papers. Cham: Springer. doi:10.1007/978-3-319-09174-7_20 -
NLM
Fernandes CG, Ferreira CE, Franco ÁJP, Schouery RCS. The envy-free pricing problem and unit-demand markets [Internet]. Combinatorial optimization: Third International Symposium, ISCO 2014 Lisbon, Portugal, March 5–7, 2014, revised selected papers. 2014 ;[citado 2024 abr. 19 ] Available from: https://doi.org/10.1007/978-3-319-09174-7_20 -
Vancouver
Fernandes CG, Ferreira CE, Franco ÁJP, Schouery RCS. The envy-free pricing problem and unit-demand markets [Internet]. Combinatorial optimization: Third International Symposium, ISCO 2014 Lisbon, Portugal, March 5–7, 2014, revised selected papers. 2014 ;[citado 2024 abr. 19 ] Available from: https://doi.org/10.1007/978-3-319-09174-7_20 - The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
- Selfish square packing
- Prices of anarchy of selfish 2D bin packing games
- A polyhedral investigation of the LCS problem and a repetition-free variant
- Repetition-free longest common subsequence
- Repetition-free longest common subsequence
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem
- Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem
- A note on Johnson, Minkoff and Phillips' algorithm for the prize-collecting Steiner tree problem
Informações sobre o DOI: 10.1007/978-3-319-09174-7_20 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas