Остановите войну!
for scientists:
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 32 matches
- 2005
- Alon Altman, Moshe Tennenholtz:
Ranking systems: the PageRank axioms. EC 2005: 1-8 - Alexandr Andoni, Jessica Staddon:
Graceful service degradation (or, how to know your payment is late). EC 2005: 9-18 - Samuil Angelov, Sven Till, Paul W. P. J. Grefen:
Dynamic and secure B2B e-contract update management. EC 2005: 19-28 - Liad Blumrosen, Noam Nisan:
On the computational power of iterative auctions. EC 2005: 29-43 - Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Mohammad Mahdian, Amin Saberi:
Multi-unit auctions with budget-constrained bidders. EC 2005: 44-51 - Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan:
Fairness and optimality in congestion games. EC 2005: 52-57 - Yiling Chen, Chao-Hsien Chu, Tracy Mullen, David M. Pennock:
Information markets vs. opinion pools: an empirical comparison. EC 2005: 58-67 - Nicolas Christin, Andreas S. Weigend, John Chuang:
Content availability, pollution and poisoning in file sharing peer-to-peer networks. EC 2005: 68-77 - Vincent Conitzer, Tuomas Sandholm:
Communication complexity of common voting rules. EC 2005: 78-87 - Vincent Conitzer, Tuomas Sandholm:
Complexity of (iterated) dominance. EC 2005: 88-97 - Esther David, Alex Rogers, Jeremy Schiff, Sarit Kraus, Nicholas R. Jennings:
Optimal design of English auctions with discrete bid levels. EC 2005: 98-107 - Edith Elkind:
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs. EC 2005: 108-116 - Michal Feldman, John Chuang, Ion Stoica, Scott Shenker:
Hidden-action in multi-hop routing. EC 2005: 117-126 - Michal Feldman, Kevin Lai, Li Zhang:
A price-anticipating resource allocation mechanism for distributed shared clusters. EC 2005: 127-136 - Pedro Ferreira, Marvin A. Sirbu:
Inefficiency in provisioning interconnected communication networks. EC 2005: 137-146 - Keith B. Frikken, Mikhail J. Atallah, Chen Zhang:
Privacy-preserving credit checking. EC 2005: 147-154 - Craig Gentry, Zulfikar Ramzan, Stuart G. Stubblebine:
Secure distributed human computation. EC 2005: 155-164 - Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mohammad Mahdian, David C. Parkes:
Online auctions with re-usable goods. EC 2005: 165-174 - Jason D. Hartline, Robert McGrew:
From optimal limited to unlimited supply auctions. EC 2005: 175-182 - Alan Holland, Barry O'Sullivan:
Robust solutions for combinatorial auctions. EC 2005: 183-192 - Samuel Ieong, Yoav Shoham:
Marginal contribution nets: a compact representation scheme for coalitional games. EC 2005: 193-202 - Nicole Immorlica, David R. Karger, Evdokia Nikolova, Rahul Sami:
First-price path auctions. EC 2005: 203-212 - Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang:
Towards truthful mechanisms for binary demand games: a general framework. EC 2005: 213-222 - Tapan Khopkar, Xin Li, Paul Resnick:
Self-selection, slipping, salvaging, slacking, and stoning: the impacts of negative feedback at eBay. EC 2005: 223-231 - Debasis Mishra, Bharath Rangarajan:
Cost sharing in a job scheduling problem using the Shapley value. EC 2005: 232-239 - Ahuva Mu'alem:
On decentralized incentive compatible mechanisms. EC 2005: 240-248 - David C. Parkes, Ruggiero Cavallo, Nick Elprin, Adam I. Juda, Sébastien Lahaie, Benjamin Lubin, Loizos Michael, Jeffrey Shneidman, Hassan Sultan:
ICE: an iterative combinatorial exchange. EC 2005: 249-258 - Michal Penn, Maria Polukarov, Moshe Tennenholtz:
Congestion games with failures. EC 2005: 259-268 - Pearl Pu, Li Chen:
Integrating tradeoff support in product search tools for e-commerce sites. EC 2005: 269-278 - Amir Ronen, Daniel Lehmann:
Nearly optimal multi attribute auctions. EC 2005: 279-285
skipping 2 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-04-25 11:26 CEST 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