default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 40 matches
- 2011
- Eitan Altman, Alejandra Estanislao, Manoj K. Panda:
Routing games on a circle. NetGCoop 2011: 1-5 - Eitan Altman, Cengis Hasan, Jean-Marie Gorce, Laurent Roullet:
Green networking: Downlink considerations. NetGCoop 2011: 1-4 - Eitan Altman, Hisao Kameda, Yezekael Hayel:
Revisiting collusion in routing games: A load balancing problem. NetGCoop 2011: 1-6 - Eitan Altman, Odile Pourtallier, Tania Jiménez, Hisao Kameda:
Symmetric games with networking applications. NetGCoop 2011: 1-5 - Amar Prakash Azad, John Musacchio:
Unilateral altruism in network routing games with atomic players. NetGCoop 2011: 1-8 - Rachid El Azouzi, Habib B. A. Sidi, Francesco De Pellegrini, Yezekael Hayel:
Markov decision evolutionary game for energy management in Delay Tolerant Networks. NetGCoop 2011: 1-7 - Dominique Barth, Johanne Cohen, Patrick Maillé, Hélia Pouyllau:
Competition among online-gaming service providers. NetGCoop 2011: 1-5 - Mohamed Baslam, Rachid El Azouzi, Essaid Sabir, Loubna Echabbi:
Market share game with adversarial Access providers: A neutral and a non-neutral network analysis. NetGCoop 2011: 1-6 - Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy:
Network and computer performance in malicious environments: The good, the bad and the ugly. NetGCoop 2011: 1-5 - Tejas Bodas, D. Manjunath:
On load balancing equilibria in multiqueue systems with multiclass traffic. NetGCoop 2011: 1-5 - Onno J. Boxma, B. J. Prabhu:
Analysis of an M/G/1 queue with customer impatience and adaptive arrival process. NetGCoop 2011: 1-4 - Luca Carlone, Vaibhav Srivastava, Francesco Bullo, Giuseppe Carlo Calafiore:
A distributed algorithm for random convex programming. NetGCoop 2011: 1-7 - Grit Classen, Arie M. C. A. Koster, Anke Schmeink:
Robust planning of green wireless networks. NetGCoop 2011: 1-5 - Roberto Cominetti, Cristóbal Guzmán:
Network congestion control with Markovian multipath routing. NetGCoop 2011: 1-8 - Emilie Coupechoux, Marc Lelarge:
Impact of clustering on diffusions and contagions in random networks. NetGCoop 2011: 1-7 - Dieter Fiems, Koen De Turck:
Queues with M/G/∞ input: A survey and some new results. NetGCoop 2011: 1-5 - Ana Galindo-Serrano, Lorenza Giupponi:
Femtocell systems with self organization capabilities. NetGCoop 2011: 1-7 - Lazaros Gkatzikis, Georgios S. Paschos, Iordanis Koutsopoulos:
Medium access games: The impact of energy constraints. NetGCoop 2011: 1-8 - Ragavendran Gopalakrishnan, Jason R. Marden, Adam Wierman:
Characterizing distribution rules for cost sharing games. NetGCoop 2011: 1-4 - Majed Haddad, Eitan Altman:
The interplay between caching and popularity. NetGCoop 2011: 1-4 - Yezekael Hayel, Elena Veronica Belmega, Eitan Altman:
Hawks and doves in a dynamic framework. NetGCoop 2011: 1-4 - Karla Kvaternik, Lacra Pavel:
Lyapunov analysis of a distributed optimization scheme. NetGCoop 2011: 1-5 - Ehud Lehrer, Eilon Solan, Dario Bauso:
Repeated games over networks with vector payoffs: the notion of attainability. NetGCoop 2011: 1-5 - David S. Leslie, Jason R. Marden:
Equilibrium selection in potential games with noisy rewards. NetGCoop 2011: 1-4 - Patrick Loiseau, Galina A. Schwartz, John Musacchio, Saurabh Amin, S. Shankar Sastry:
Congestion pricing using a raffle-based scheme. NetGCoop 2011: 1-8 - François Mériaux, Samson Lasaulce:
Mean-field games and green power control. NetGCoop 2011: 1-5 - Igal Milchtaich:
Representation of finite games as network congestion games. NetGCoop 2011: 1-5 - José Niño-Mora, Sofia S. Villar:
Sensor scheduling for hunting elusive hiding targets via whittle's restless bandit index policy. NetGCoop 2011: 1-8 - Stefano Paris, Fabio Martignon, Ilario Filippini, Antonio Capone:
A bandwidth marketplace for heterogeneous mobile networks. NetGCoop 2011: 1-5 - Sérgio Daniel Pequito, A. Pedro Aguiar, Bruno Sinopoli, Diogo A. Gomes:
Nonlinear estimation using Mean Field Games. NetGCoop 2011: 1-5
skipping 10 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-03 22:56 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint