Demo Data from EDBT 2026 / reviewers in the wild / expert
Rajat Bhattacharjee
dblp:95/6473
· DBLP profile ↗
4ranked-venue papers
4as first author
0since 2021 · last 2009
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 3 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author
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.
| Computer networks
2 papers |
Network performance modeling · 53% Routing and switching · 32% Internet architecture and protocols · 15% | |
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Routing and switching
packet forwarding |
0.1 | 2 | 2004 | Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model · SIAM J. Comput. 2004 Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model · FOCS 2003 |
Network performance modeling › stability analysis
queue stability |
0.1 | 2 | 2004 | Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model · SIAM J. Comput. 2004 Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model · FOCS 2003 |
Information retrieval
ranking |
0.1 | 1 | 2007 | Algorithms and incentives for robust ranking · SODA 2007 |
Algorithmic game theory and mechanism design
incentive mechanism |
0.1 | 1 | 2007 | Algorithms and incentives for robust ranking · SODA 2007 |
Algorithmic game theory and mechanism design
robust ranking |
0.1 | 1 | 2007 | Algorithms and incentives for robust ranking · SODA 2007 |
Network performance modeling › queueing analysis › queueing models of computer systems
adversarial queueing |
0.1 | 2 | 2004 | Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model · FOCS 2003 Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model · SIAM J. Comput. 2004 |
Internet architecture and protocols › packet scheduling
FIFO scheduling |
0.0 | 1 | 2003 | Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model · FOCS 2003 |
Methods — techniques the papers use, named apart from their topics
mechanism design · 0.1game-theoretic analysis · 0.1instability construction · 0.0adversarial queueing model · 0.0adversarial queueing analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | An incentive-based architecture for social recommendationsabstractWe present an incentive-based architecture for providing recommendations in a social network. We maintain a distinct reputation system for each individual and we rely on users to identify appropriate correlations and rate the items using asystem-providedrecommendationlanguage.Thekeyidea is to design an incentive structure and a ranking system such that any inaccuracy in the recommendations implies the existence of a profitable arbitrage opportunity, hence making the system resistant to malicious spam and presentation bias. We also show that, under mild assumptions, our architecture provides users with incentive to minimize the Kullback-Leibler divergence between the ratings and the actual item qualities, quickly driving the system to an equilibrium state with accurate recommendations. Rajat Bhattacharjee, Ashish Goel, Kostas Kollias |
RecSys | 1 |
| 2007 | Algorithms and incentives for robust ranking
Rajat Bhattacharjee, Ashish Goel |
SODA | 1 |
| 2004 | Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing ModelabstractWe study the stability of the commonly used packet forwarding protocol, FIFO (first in first out), in the adversarial queueing model. We prove that FIFO can become unstable, i.e., lead to unbounded buffer-occupancies and queueing delays, at arbitrarily low injection rates. In order to demonstrate instability at rate r, we use a network of size $\tilde{O}(1/r)$. Rajat Bhattacharjee, Ashish Goel, Zvi Lotker |
SIAM J. Comput. | 1 |
| 2003 | Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing ModelabstractWe study the stability of the commonly used packet forwarding protocol, FIFO (First In First Out), in the adversarial queuing model. We prove that FIFO can become unstable, i.e., lead to unbounded buffer-occupancies and queuing delays, at arbitrarily low injection rates. In order to demonstrate instability at rate r, we use a network of size polynomial in 1/r. Rajat Bhattacharjee, Ashish Goel |
FOCS | 1 |