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 74 matches
- 2012
- Vibhanshu Abhishek, Kartik Hosanagar:
Optimal bidding in multi-item multi-slot sponsored search auctions. EC 2012: 2 - Vibhanshu Abhishek, Kartik Hosanagar, Peter S. Fader:
On aggregation bias in sponsored search data: existence andimplications. EC 2012: 1 - Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, Tim Roughgarden:
Combinatorial auctions with restricted complements. EC 2012: 3-16 - Saeed Alaei, Hu Fu, Nima Haghpanah, Jason D. Hartline, Azarakhsh Malekian:
Bayesian optimal auctions via multi- to single-agent reduction. EC 2012: 17 - Saeed Alaei, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Online prophet-inequality matching with applications to ad allocation. EC 2012: 18-35 - Noga Alon, Moshe Babaioff, Ron Karidi, Ron Lavi, Moshe Tennenholtz:
Sequential voting with externalities: herding in social networks. EC 2012: 36 - Sanjeev Arora, Rong Ge, Sushant Sachdeva, Grant Schoenebeck:
Finding overlapping communities in social networks: toward a rigorous approach. EC 2012: 37-54 - Eduardo M. Azevedo, Eric Budish:
Strategyproofness in the large as a desideratum for market design. EC 2012: 55 - Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg, Aleksandrs Slivkins:
Dynamic pricing with limited supply. EC 2012: 74-91 - Moshe Babaioff, Shahar Dobzinski, Sigal Oren, Aviv Zohar:
On bitcoin and red balloons. EC 2012: 56-73 - Moshe Babaioff, Robert Kleinberg, Renato Paes Leme:
Optimal mechanisms for selling information. EC 2012: 92-109 - Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren:
Optimization with demand oracles. EC 2012: 110-127 - Ashwinkumar Badanidiyuru, Robert Kleinberg, Yaron Singer:
Learning on a budget: posted price mechanisms for online procurement. EC 2012: 128-145 - Eytan Bakshy, Dean Eckles, Rong Yan, Itamar Rosenn:
Social influence in social advertising: evidence from field experiments. EC 2012: 146-161 - Dirk Bergemann, Ji Shen, Yun Xu, Edmund M. Yeh:
Multi-dimensional mechanism design with limited information. EC 2012: 162-178 - Anand Bhalgat, Sreenivas Gollapudi, Kamesh Munagala:
Mechanisms and allocations with positive network externalities. EC 2012: 179-196 - Craig Boutilier, Ioannis Caragiannis, Simi Haber, Tyler Lu, Ariel D. Procaccia, Or Sheffet:
Optimal social choice functions: a utilitarian view. EC 2012: 197-214 - Aseem Brahma, Mithun Chakraborty, Sanmay Das, Allen Lavoie, Malik Magdon-Ismail:
A bayesian market maker. EC 2012: 215-232 - Felix Brandt, Markus Brill:
Computing dominance-based solution concepts. EC 2012: 233 - John W. Byers, Michael Mitzenmacher, Georgios Zervas:
The groupon effect on yelp ratings: a root cause analysis. EC 2012: 248-265 - Ioannis Caragiannis, Edith Elkind, Mario Szegedy, Lan Yu:
Mechanism design: from partial to probabilistic verification. EC 2012: 266-283 - Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure. EC 2012: 284-301 - Deepayan Chakrabarti, Erik Vee:
Traffic shaping to optimize ad delivery. EC 2012: 302-318 - Peiji Chen, Wenjing Ma, Srinath Mandalapu, Chandrashekhar Nagarajan, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Manfai Yu, Jason Y. Zien:
Ad serving using a compact allocation plan. EC 2012: 319-336 - Yun Kuen Cheung, Richard Cole, Ashish Rastogi:
Tatonnement in ongoing markets of complementary goods. EC 2012: 337-354 - Flavio Chierichetti, Jon M. Kleinberg, Alessandro Panconesi:
How to schedule a cascade in an arbitrary graph. EC 2012: 355-368 - Olivier Compte, Ron Lavi, Ella Segev:
Efficiency of sequential english auctions with dynamic arrivals. EC 2012: 369 - Constantinos Daskalakis, S. Matthew Weinberg:
Symmetries and optimal multi-dimensional mechanism design. EC 2012: 370-387 - Nikhil R. Devanur, Balasubramanian Sivan, Yossi Azar:
Asymptotically optimal algorithm for stochastic adwords. EC 2012: 388-404 - Shahar Dobzinski, Jan Vondrák:
The computational complexity of truthfulness in combinatorial auctions. EC 2012: 405-422
skipping 44 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-10-31 19:10 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