Остановите войну!
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 41 matches
- 2009
- Gagan Aggarwal, Gagan Goel, Aranyak Mehta:
Efficiency of (revenue-)optimal mechanisms. EC 2009: 235-242 - Shipra Agrawal, Erick Delage, Mark Peters, Zizhuo Wang, Yinyu Ye:
A unified framework for dynamic pari-mutuel information market design. EC 2009: 255-264 - Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasan:
On random sampling auctions for digital goods. EC 2009: 187-196 - Nikolay Archak, Panagiotis G. Ipeirotis:
Modeling volatility in prediction markets. EC 2009: 275-284 - Itai Ashlagi, Shahar Dobzinski, Ron Lavi:
An optimal lower bound for anonymous scheduling mechanisms. EC 2009: 169-176 - Moshe Babaioff, Jason D. Hartline, Robert D. Kleinberg:
Selling ad campaigns: online algorithms with cancellations. EC 2009: 61-70 - Moshe Babaioff, Yogeshwer Sharma, Aleksandrs Slivkins:
Characterizing truthful multi-armed bandit mechanisms: extended abstract. EC 2009: 79-88 - Eytan Bakshy, Brian Karrer, Lada A. Adamic:
Social influence and the diffusion of user-created content. EC 2009: 325-334 - Maria-Florina Balcan, Avrim Blum, Yishay Mansour:
The price of uncertainty. EC 2009: 285-294 - Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman:
An exact almost optimal algorithm for target set selection in social networks. EC 2009: 355-362 - Milan Bradonjic, Gunes Ercal-Ozkaya, Adam Meyerson, Alan Roytman:
On the price of mediation. EC 2009: 315-324 - Tanmoy Chakraborty, Michael J. Kearns, Sanjeev Khanna:
Network bargaining: algorithms and structural results. EC 2009: 159-168 - Shuchi Chawla, Feng Niu:
The price of anarchy in bertrand games. EC 2009: 305-314 - Ning Chen, Arpita Ghosh, Nicolas S. Lambert:
Social lending. EC 2009: 335-344 - Geoffroy de Clippel, Victor Naroditskiy, Amy Greenwald:
Destroy to save. EC 2009: 207-214 - Florin Constantin, David C. Parkes:
Self-correcting sampling-based dynamic multi-unit auctions. EC 2009: 89-98 - Nikhil R. Devanur, Jason D. Hartline:
Limited and online supply and the bayesian foundations of prior-free mechanism design. EC 2009: 41-50 - Nikhil R. Devanur, Sham M. Kakade:
The price of truthfulness for pay-per-click auctions. EC 2009: 99-106 - Nikhil R. Devanur, Thomas P. Hayes:
The adwords problem: online keyword matching with budgeted bidders under random permutations. EC 2009: 71-78 - Dominic DiPalantino, Milan Vojnovic:
Crowdsourcing and all-pay auctions. EC 2009: 119-128 - Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan:
Revenue submodularity. EC 2009: 243-252 - Felix A. Fischer, Ariel D. Procaccia, Alex Samorodnitsky:
A new perspective on implementation by voting trees. EC 2009: 31-40 - Sharad Goel, Daniel M. Reeves, David M. Pennock:
Collective revelation: a mechanism for self-verified, weighted, and truthful predictions. EC 2009: 265-274 - Renato D. Gomes, Kane S. Sweeney:
Bayes-nash equilibria of the generalized second price auction. EC 2009: 107-108 - Paul Harrenstein, Mathijs de Weerdt, Vincent Conitzer:
A qualitative vickrey auction. EC 2009: 197-206 - Jason D. Hartline, Tim Roughgarden:
Simple versus optimal mechanisms. EC 2009: 225-234 - Shaili Jain, Yiling Chen, David C. Parkes:
Designing incentives for online question and answer forums. EC 2009: 129-138 - Nicolas S. Lambert, Yoav Shoham:
Eliciting truthful answers to multiple-choice questions. EC 2009: 109-118 - Tomasz P. Michalak, Talal Rahwan, Jacek Sroka, Andrew James Dowell, Michael J. Wooldridge, Peter McBurney, Nicholas R. Jennings:
On representing coalitional games with externalities. EC 2009: 11-20 - Vahab S. Mirrokni, Alexander Skopalik:
On the complexity of nash dynamics and sink equilibria. EC 2009: 1-10
skipping 11 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 20:13 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