Second-price ad auctions with binary bids and markets with good competition (2014)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1016/j.tcs.2013.08.022
- Subjects: OTIMIZAÇÃO COMBINATÓRIA; TEORIA DOS JOGOS; MATEMÁTICA ECONÔMICA; TEORIA DOS GRAFOS; MERCADO FINANCEIRO
- Language: Inglês
- Imprenta:
- Source:
- Título: Theoretical Computer Science
- ISSN: 0304-3975
- Volume/Número/Paginação/Ano: v. 540-541, p. 103-114, 2014
- Conference titles: International Symposium on Combinatorial Optimization
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: hybrid
- Licença: unspecified-oa
-
ABNT
FERNANDES, Cristina Gomes e SCHOUERY, Rafael Crivellari Saliba. Second-price ad auctions with binary bids and markets with good competition. Theoretical Computer Science, v. 540-541, p. 103-114, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2013.08.022. Acesso em: 09 jan. 2026. -
APA
Fernandes, C. G., & Schouery, R. C. S. (2014). Second-price ad auctions with binary bids and markets with good competition. Theoretical Computer Science, 540-541, 103-114. doi:10.1016/j.tcs.2013.08.022 -
NLM
Fernandes CG, Schouery RCS. Second-price ad auctions with binary bids and markets with good competition [Internet]. Theoretical Computer Science. 2014 ; 540-541 103-114.[citado 2026 jan. 09 ] Available from: https://doi.org/10.1016/j.tcs.2013.08.022 -
Vancouver
Fernandes CG, Schouery RCS. Second-price ad auctions with binary bids and markets with good competition [Internet]. Theoretical Computer Science. 2014 ; 540-541 103-114.[citado 2026 jan. 09 ] Available from: https://doi.org/10.1016/j.tcs.2013.08.022 - Repetition-free longest common subsequence of random sequences
- Trajectory clustering of points in R
- Approximation algorithms for the max-buying problem with limited supply
- Stability in geodesics for memoryless binary long-lived consensus
- Approximating minimum k-section in trees with linear diameter
- Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)
- A new approximation algorithm for finding heavy planar subgraphs
- Maximum series-parallel subgraph
- Maximum series-parallel subgraph
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
Informações sobre o DOI: 10.1016/j.tcs.2013.08.022 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
