Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Eleni Bakali

dblp:190/7121 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
3since 2021 · last 2024
—ORCID · none

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

Theory of computation · 5 · 4 first-author · 2 since 2021Computer networks · 1 · 1 since 2021

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
1 paper
Network optimization and economics · 67% Internet of things and sensor networks · 33%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › game theory
bounded rationality
0.612022
Optimizing Mobile Crowdsensing Platforms for Boundedly Rational Users · IEEE Trans. Mob. Comput. 2022
Network optimization and economics › mechanism design
incentive mechanism
0.612022
Optimizing Mobile Crowdsensing Platforms for Boundedly Rational Users · IEEE Trans. Mob. Comput. 2022
Internet of things and sensor networks
mobile crowdsensing
0.612022
Optimizing Mobile Crowdsensing Platforms for Boundedly Rational Users · IEEE Trans. Mob. Comput. 2022
Mathematical optimization
optimization
0.212022
Optimizing Mobile Crowdsensing Platforms for Boundedly Rational Users · IEEE Trans. Mob. Comput. 2022

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

fast-and-frugal trees · 1.1cognitive psychology modeling · 1.1
YearPublicationVenuePosition
2024 On the Power of Counting the Total Number of Computation Paths of NPTMs
Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
TAMC1
2022 Completeness, approximability and exponential time results for counting problems with easy decision version
Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
Theor. Comput. Sci.2
2022 Optimizing Mobile Crowdsensing Platforms for Boundedly Rational Users
abstract
In participatory mobile crowdsensing (MCS) users repeatedly makechoicesamong a finite set of alternatives, i.e., whether to contribute to a task or not and which task to contribute to. The platform coordinating the MCS campaigns oftenengineersthese choices by selecting MCS tasks to recommend to users and offering monetary or in-kind rewards to motivate their contributions to them. In this paper, we revisit the well-investigated question of how to optimize the contributions of mobile end users to MCS tasks. However, we depart from the bulk of related literature by explicitly accounting for thebounded rationalityevidenced in human decision making. Bounded rationality is a consequence of cognitive and other kinds of constraints, e.g., time pressure, and has been studied extensively in behavioral science. We first draw on work in the field of cognitive psychology to model the way boundedly rational users respond to MCS task offers asFast-and-Frugal-Trees (FFTs). With each MCS task modeled as a vector of feature values, the decision process in FFTs proceeds through sequentially parsing lexicographically ordered features, resulting in choices that are satisfying but not necessarily optimal. We then formulate, analyze and solve the novel optimization problems that emerge for both nonprofit and for-profit MCS platforms in this context. The evaluation of our optimization approach highlights significant gains in both platform revenue and quality of task contributions when compared to heuristic rules that do not account for the lexicographic structure in human decision making. We show how this modeling framework readily extends to platforms that present multiple task offers to the users. Finally, we discuss how these models can be trained, iterate on their assumptions, and point to their implications for applications beyond MCS, where end-users make choices through the mediation of mobile/online platforms.
Merkourios Karaliopoulos, Eleni Bakali
IEEE Trans. Mob. Comput.2
2020 Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\)
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis
TAMC1
2017 Stathis Zachos at 70!
Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis 0001, Martin Fürer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika
CIAC1
2017 Completeness Results for Counting Problems with Easy Decision
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
CIAC1