TEST - Catálogo BURRF
   

Web and internet economics : 10th international conference, wine 2014, beijing, china, december 14-17, 2014. Proceedings / edited by Tie-Yan Liu, Qi Qi, Yinyu Ye.

Colaborador(es): Tipo de material: TextoTextoSeries Lecture Notes in Computer Science ; 8877Editor: Cham : Springer International Publishing : Springer, 2014Descripción: xiv, 500 páginas : 24 ilustracionesTipo de contenido:
  • texto
Tipo de medio:
  • computadora
Tipo de portador:
  • recurso en línea
ISBN:
  • 9783319131290
Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:
  • QA75.5-76.95
Recursos en línea:
Contenidos:
Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations -- Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria -- Limiting Price Discrimination when Selling Products with Positive Network Externalities -- Computing Approximate Nash Equilibria in Polymatrix Games -- Optimal Cost-Sharing in Weighted Congestion Games -- Truthful Multi-unit Procurements with Budgets -- The Shapley Value in Knapsack Budgeted Games -- Fast Convex Decomposition for Truthful Social Welfare Approximation -- A Near-Optimal Mechanism for Impartial Selection -- Value-based Network Externalities and Optimal Auction Design -- Matching Dynamics with Constraints -- Truthful Approximations to Range Voting -- Resource Competition on Integral Polymatroids -- PTAS for Minimax Approval Voting -- Biobjective Online Bipartite Matching -- Dynamic Reserve Prices for Repeated Auctions: Learning from Bids.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Springer eBooks

Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations -- Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria -- Limiting Price Discrimination when Selling Products with Positive Network Externalities -- Computing Approximate Nash Equilibria in Polymatrix Games -- Optimal Cost-Sharing in Weighted Congestion Games -- Truthful Multi-unit Procurements with Budgets -- The Shapley Value in Knapsack Budgeted Games -- Fast Convex Decomposition for Truthful Social Welfare Approximation -- A Near-Optimal Mechanism for Impartial Selection -- Value-based Network Externalities and Optimal Auction Design -- Matching Dynamics with Constraints -- Truthful Approximations to Range Voting -- Resource Competition on Integral Polymatroids -- PTAS for Minimax Approval Voting -- Biobjective Online Bipartite Matching -- Dynamic Reserve Prices for Repeated Auctions: Learning from Bids.

Para consulta fuera de la UANL se requiere clave de acceso remoto.

Universidad Autónoma de Nuevo León
Secretaría de Extensión y Cultura - Dirección de Bibliotecas @
Soportado en Koha