Anna Kazeykina

dblp:25/8279 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 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.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 100%
Theoretical computer science
2 papers
Algorithmic game theory and mechanism design · 50% Approximation and online algorithms · 50%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › ranking › multi-objective ranking
diversity-aware ranking
0.112010
Approximation Algorithms for Diversified Search Ranking · ICALP (2) 2010
Information retrieval
search result diversification
0.112010
Approximation Algorithms for Diversified Search Ranking · ICALP (2) 2010
Information retrieval › information filtering › technology-assisted review
stopping criteria
0.112010
Optimal Strategies for Reviewing Search Results · AAAI 2010
Approximation and online algorithms
approximation algorithms
0.112010
Approximation Algorithms for Diversified Search Ranking · ICALP (2) 2010
Algorithmic game theory and mechanism design
rational agents
0.112010
Optimal Strategies for Reviewing Search Results · AAAI 2010

Methods — techniques the papers use, named apart from their topics

expected utility maximization · 0.2approximation algorithm · 0.2stopping rules · 0.1stopping rule · 0.1
YearPublicationVenuePosition
2010 Optimal Strategies for Reviewing Search Results
abstract
Web search engines respond to a query by returning more results than can be reasonably reviewed. These results typically include the title, link, and snippet of content from the target link. Each result has the potential to be useful or useless and thus reviewing it has a cost and potential benefit. This paper studies the behavior of a rational agent in this setting, whose objective is to maximize the probability of finding a satisfying result while minimizing cost. We propose two similar agents with different capabilities: one that only compares result snippets relatively and one that predicts from the result snippet whether the result will be satisfying. We prove that the optimal strategy for both agents is a stopping rule: the agent reviews a fixed number of results until the marginal cost is greater than the marginal expected benefit, maximizing the overall expected utility. Finally, we discuss the relationship between rational agents and search users and how our findings help us understand reviewing behaviors.
Jeff Huang 0002, Anna Kazeykina
AAAI2
2010 Approximation Algorithms for Diversified Search Ranking
Nikhil Bansal 0001, Kamal Jain, Anna Kazeykina, Joseph Naor
ICALP (2)3