Brief Announcement: A Hierarchy of Congested Clique Models: From Broadcast to Unicast

Eric Rémila, Florent Becker, Antonio Fernandez Anta and Ivan Rapaport
Additional contact information
Florent Becker: LIEN - Laboratoire d'Instrumentation Electronique de Nancy - UHP - Université Henri Poincaré - Nancy 1
Antonio Fernandez Anta: Institute IMDEA Networks [Madrid]
Ivan Rapaport: DIM - Departamento de Ingeniería Matemática [Santiago] - UCHILE - Universidad de Chile = University of Chile [Santiago] - CNRS - Centre National de la Recherche Scientifique, CMM - Centre de modélisation mathématique / Centro de Modelamiento Matemático [Santiago] - UCHILE - Universidad de Chile = University of Chile [Santiago] - CNRS - Centre National de la Recherche Scientifique

Post-Print from HAL

Keywords: Game; theory (search for similar items in EconPapers)
Date: 2015-06-21
References: Add references at CitEc
Citations:

Published in ACM Symposium on Principles of Distributed Computing (PODC), Jun 2015, Donostia-San Sebastián, Spain

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:halshs-01196558

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().