Demo Data from EDBT 2026 / reviewers in the wild / expert
Juan Feng 0001
dblp:52/6711-1
· DBLP profile ↗
7ranked-venue papers
4as first author
0since 2021 · last 2012
0000-0002-0548-1531ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 1 first-authorTheory of computation · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Algorithmic game theory and mechanism design · 100% | |
| Computer networks
1 paper |
Network optimization and economics · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design › auction theory
advertising auctions |
0.1 | 1 | 2007 | Dynamic price competition on the internet: advertising auctions · EC 2007 |
Algorithmic game theory and mechanism design
auction theory |
0.1 | 1 | 2007 | Dynamic price competition on the internet: advertising auctions · EC 2007 |
Algorithmic game theory and mechanism design › pricing
price competition |
0.1 | 1 | 2007 | Dynamic price competition on the internet: advertising auctions · EC 2007 |
Algorithmic game theory and mechanism design
revenue maximization |
0.0 | 1 | 2002 | Paid placement strategies for internet search engines · WWW 2002 |
Methods — techniques the papers use, named apart from their topics
sensitivity analysis · 0.1economic modeling · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Negative price premium effect in online market - The impact of competition and buyer informativeness on the pricing strategies of sellers with different reputation levels
Richard Yuewen Liu, Juan Feng 0001, Kwok Kee Wei |
Decis. Support Syst. | 2 |
| 2010 | Simultaneous vs. sequential sales: Bidder competition and supply uncertainty
Juan Feng 0001, Kalyan Chatterjee |
Decis. Support Syst. | 1 |
| 2007 | The impact of sponsored results on the quality of information gatekeepersabstractInformation gatekeepers, such as Internet search engines, travel experts, comparison shopping systems, credit raters, radio deejays, and movie critics, are an essential entry point for many information search and decision making tasks. They make recommendations on these tasks based on their expertise, but also frequently due to sponsorship by interested merchants. We develop and analyze a tractable model in which consumers may prefer or dislike the use of sponsored results in the recommendations, merchants' value for sponsorship increases with the gatekeeper's user base, and when there are negative externalities among merchants competing for consumers' attention. The optimal strategy strikes a balance between sponsorship revenues from merchants and user-based revenues. The gatekeeper may employ sponsored recommendations even when doing so is detrimental to users, or may not present enough sponsored results even when these improve the quality of recommendations. Product innovations or better domain expertise give the gatekeeper greater flexibility in using sponsored results. Hemant K. Bhargava, Juan Feng 0001 |
ICEC | 2 |
| 2007 | Dynamic price competition on the internet: advertising auctionsabstractNo abstract available. Juan Feng 0001, Xiaoquan (Michael) Zhang |
EC | 1 |
| 2007 | Implementing Sponsored Search in Web Search Engines: Computational Evaluation of Alternative MechanismsabstractThe practice of sponsored search advertising—where advertisers pay a fee to appear alongside particular Web search results—is now one of the largest and fastest growing source of revenue for Web search engines. We model and compare several mechanisms for allocating sponsored slots, including stylized versions of those used by Overture and Google, the two biggest brokers of sponsored search. The performance of these mechanisms depends on the degree of correlation between providers’ willingness to pay and their relevance to the search term. Ranking providers based on the product of relevance and bid price performs well and is robust across varying degrees of correlation. Ranking purely based on bid price fares nearly as well when bids and relevance are positively correlated (the expected regime), and is further enhanced by adding an editorial filter. Regardless of the allocation mechanism, sponsored search revenues are lower when users’ attention decays quickly at lower ranks, emphasizing the need to develop better user interfaces and control features. The search engine can address initial inscience of relevance scores by modifying rank allocations over time as it observes clickthroughs at each rank. We propose a rank-revision strategy that weights clicks on lower ranked items more than clicks on higher ranked items. This method is shown to converge to the optimal (maximum revenue) ordering faster and more consistently than other methods. Juan Feng 0001, Hemant K. Bhargava, David M. Pennock |
INFORMS J. Comput. | 1 |
| 2003 | Comparison of allocation rules for paid placement advertising in search enginesabstractWeb sites such as Internet search engines, web portals, and comparison shopping services, aim to provide information or recommendations to users who might be searching for information or trying to make a purchase decision. Paid placement advertising has established itself as an important revenue resource for such information-oriented web sites, which often deliberately bias their recommendations (or sequence of results) in return for a fee from providers who wish to get preferential placement on the results page. This article examines the paid-placement ranking strategies of the two dominant firms in this industry, and compares their revenues under different scenarios via computational simulation. We find that ranking paid placement links by the product of willingness to pay and relevance is better, in most cases, than ranking by willingness to pay alone, which performs best only when the correlation between the provider's relevance and willingness to pay is large. We also analyze the impact of the competition for placement slots on placement revenues under these mechanisms. Juan Feng 0001, Hemant K. Bhargava, David M. Pennock |
ICEC | 1 |
| 2002 | Paid placement strategies for internet search enginesabstractInternet search engines and comparison shopping have recently begun implementing a paid placement strategy, where some content providers are given prominent positioning in return for a placement fee. This bias generates placement revenues but creates a disutility to users, thus reducing user-based revenues. We formulate the search engine design problem as a tradeoff between these two types of revenues. We demonstrate that the optimal placement strategy depends on the relative benefits (to providers) and disutilities (to users) of paid placement. We compute the optimal placement fee, characterize the optimal bias level, and analyze sensitivity of the placement strategy to various factors. In the optimal paid placement strategy, the placement revenues are set below the monopoly level due to its negative impact on advertising revenues. An increase in the search engine's quality of service allows it to improve profits from paid placement, moving it closer to the ideal. However, an increase in the value-per-user motivates the gatekeeper to increase market share by reducing further its reliance on paid placement and fraction of paying providers. Hemant K. Bhargava, Juan Feng 0001 |
WWW | 2 |