Lihi Dery
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Lihi Dery has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Meir Kalech
The Stein Faculty of Computer and Information Science, Ben-Gurion University of the Negev, Beersheba 84105, Israel
9 shared publications - Zinovi Rabinovich
Carleton University
5 shared publications Bracha Shapira
Ben Gurion University, Beer Sheva, Israel
4 shared publicationsLior Rokach
Ben Gurion University, Beer Sheva, Israel
4 shared publications- Svetlana Obraztsova
Nanyang Technological University
4 shared publications - Tal Grinshpoun
Ariel University
4 shared publications
Latest Publications
- Open Access
- 13 July 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Efficiency-fairness tradeoff in distributed satellite scheduling
The growing demand for Earth observation satellite services requires the development of efficient and fair planning solutions. As users seek to fulfill their observation requirements, the scheduling solution must balance efficiency and fairness across stakeholders. However, concerns over privacy or proprietary interests might discourage stakeholders from sharing their requests with a centralized system, highlighting the need for a distributed approach. This paper addresses the multi-objective optimization problem of distributed scheduling for Earth observation satellites. We propose two novel algorithms designed to achieve a balanced trade-off between the competing objectives of efficiency and fairness. Experimental evaluation reveals that each algorithm presents a unique trade-off between efficiency and fairness based on problem parameters.
- 13 July 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Open AccessEfficiency-fairness tradeoff in distributed satellite scheduling
The growing demand for Earth observation satellite services requires the development of efficient and fair planning solutions. As users seek to fulfill their observation requirements, the scheduling solution must balance efficiency and fairness across stakeholders. However, concerns over privacy or proprietary interests might discourage stakeholders from sharing their requests with a centralized system, highlighting the need for a distributed approach. This paper addresses the multi-objective optimization problem of distributed scheduling for Earth observation satellites. We propose two novel algorithms designed to achieve a balanced trade-off between the competing objectives of efficiency and fairness. Experimental evaluation reveals that each algorithm presents a unique trade-off between efficiency and fairness based on problem parameters.
- Open Access
- 6 March 2026
- Published by Taylor & Francis in Assessment & Evaluation in Higher Education
- p. 1-8
Recency effects in pairwise comparisons during peer assessment of oral presentations
- 6 March 2026
- Published by Taylor & Francis in Assessment & Evaluation in Higher Education
- p. 1-8
Open AccessRecency effects in pairwise comparisons during peer assessment of oral presentations
- Open Access
- 26 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 205593-205600
Platform Policies and Quality Class: When are Hotels Prone to Rating Manipulation?
Online platforms depend on trust and reputation, yet these are open to manipulation. This paper develops a game-theoretic model of rating manipulation that accounts for platform enforcement policies, market competition, and class differentiation among service providers. The model shows that stricter sanctions can paradoxically increase incentives to manipulate by reducing competition, while greater competition reduces manipulation. To illustrate the model’s applicability, we analyze hotel reviews from Bangkok collected from Agoda, where only verified customers can post reviews, and TripAdvisor, where reviews are open to all users. The empirical results confirm that lower-class hotels are more prone to manipulation than higher-class hotels, consistent with theoretical predictions. Together, the theoretical and empirical findings provide insights for the design of trust and reputation systems in online platforms, highlighting trade-offs between enforcement, competition, and the integrity of ratings.
- 26 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 205593-205600
Open AccessPlatform Policies and Quality Class: When are Hotels Prone to Rating Manipulation?
Online platforms depend on trust and reputation, yet these are open to manipulation. This paper develops a game-theoretic model of rating manipulation that accounts for platform enforcement policies, market competition, and class differentiation among service providers. The model shows that stricter sanctions can paradoxically increase incentives to manipulate by reducing competition, while greater competition reduces manipulation. To illustrate the model’s applicability, we analyze hotel reviews from Bangkok collected from Agoda, where only verified customers can post reviews, and TripAdvisor, where reviews are open to all users. The empirical results confirm that lower-class hotels are more prone to manipulation than higher-class hotels, consistent with theoretical predictions. Together, the theoretical and empirical findings provide insights for the design of trust and reputation systems in online platforms, highlighting trade-offs between enforcement, competition, and the integrity of ratings.
- 15 October 2025
- Published by Polish Information Processing Society PTI in Annals of Computer Science and Information Systems
- Vol. 43, 641-646
Cognitive-Aware Peer Assessment: Design Implications from a Classroom Deployment
- 15 October 2025
- Published by Polish Information Processing Society PTI in Annals of Computer Science and Information Systems
- Vol. 43, 641-646
Cognitive-Aware Peer Assessment: Design Implications from a Classroom Deployment
- Open Access
- 1 July 2025
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 93
Secure order based voting using distributed tallying
- 1 July 2025
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 93
Open AccessSecure order based voting using distributed tallying
- Open Access
- 12 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 245-248
A Fair Share: Fair Allocation of Satellite Observation Windows According to User Preferences in a Distributed Setting
- 12 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 245-248
Open AccessA Fair Share: Fair Allocation of Satellite Observation Windows According to User Preferences in a Distributed Setting
- Open Access
- 15 May 2025
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 39 (1) , 1-30
Distributed Course Allocation with Asymmetric Friendships
Students’ decisions on whether to take a class are strongly affected by whether their friends plan to take the class with them. A student may prefer to be assigned to a course they like less, just to be with their friends, rather than taking a more preferred class alone. It has been shown that taking classes with friends positively affects academic performance. Thus, academic institutes should prioritize friendship relations when assigning course seats. The introduction of friendship relations results in several non-trivial changes to current course allocation methods. This paper explores how course allocation mechanisms can account for friendships between students and provide a unique, distributed solution. Specifically, we approach the problem by framing it as an asymmetric distributed constraint optimization problem and develop a new dedicated algorithm. Our extensive evaluation includes both simulated data and a study involving 177 students, focusing on their preferences regarding both courses and friendships. The findings indicate that our algorithm achieves significant utility for the students, maintaining fairness in the solution and adhering to the limitations on course seat capacities.
- 15 May 2025
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 39 (1) , 1-30
Open AccessDistributed Course Allocation with Asymmetric Friendships
Students’ decisions on whether to take a class are strongly affected by whether their friends plan to take the class with them. A student may prefer to be assigned to a course they like less, just to be with their friends, rather than taking a more preferred class alone. It has been shown that taking classes with friends positively affects academic performance. Thus, academic institutes should prioritize friendship relations when assigning course seats. The introduction of friendship relations results in several non-trivial changes to current course allocation methods. This paper explores how course allocation mechanisms can account for friendships between students and provide a unique, distributed solution. Specifically, we approach the problem by framing it as an asymmetric distributed constraint optimization problem and develop a new dedicated algorithm. Our extensive evaluation includes both simulated data and a study involving 177 students, focusing on their preferences regarding both courses and friendships. The findings indicate that our algorithm achieves significant utility for the students, maintaining fairness in the solution and adhering to the limitations on course seat capacities.
- Open Access
- 16 October 2024
- Published by IOS Press
- p. 1519-1526
Interactive and Iterative Peer Assessment
Iterative peer grading activities may keep students engaged during in-class project presentations. Effective methods for collecting and aggregating peer assessment data are essential. Students tend to grade projects favorably. So, while asking students for numeric grades is a common approach, it often leads to inflated grades across all projects, resulting in numerous ties for the top grades. Additionally, students may strategically assign lower grades to others’ projects so that their projects will shine. Alternatively, requesting students to rank all projects from best to worst presents challenges due to limitations in human cognitive capacity. To address these issues, we propose a novel peer grading model consisting of (a) an algorithm designed to elicit student evaluations and (b) a median-based voting protocol for aggregating grades to a single ranked order that reduces ties. An application based on our model was deployed and tested in a university course, demonstrating fewer ties between alternatives and a significant decrease in students’ cognitive and communication burdens.
- 16 October 2024
- Published by IOS Press
- p. 1519-1526
Open AccessInteractive and Iterative Peer Assessment
Iterative peer grading activities may keep students engaged during in-class project presentations. Effective methods for collecting and aggregating peer assessment data are essential. Students tend to grade projects favorably. So, while asking students for numeric grades is a common approach, it often leads to inflated grades across all projects, resulting in numerous ties for the top grades. Additionally, students may strategically assign lower grades to others’ projects so that their projects will shine. Alternatively, requesting students to rank all projects from best to worst presents challenges due to limitations in human cognitive capacity. To address these issues, we propose a novel peer grading model consisting of (a) an algorithm designed to elicit student evaluations and (b) a median-based voting protocol for aggregating grades to a single ranked order that reduces ties. An application based on our model was deployed and tested in a university course, demonstrating fewer ties between alternatives and a significant decrease in students’ cognitive and communication burdens.
- Open Access
- 7 October 2024
- Published by Springer Nature in Journal of Scheduling
- Vol. 27 (5) , 507-524
Scheduling of Earth observing satellites using distributed constraint optimization
Earth observation satellites (EOS) are satellites equipped with optical sensors that orbit the Earth to take photographs of particular areas at the request of users. With the development of space technology, the number of satellites has increased continuously. Yet still, the number of satellites cannot meet the explosive growth of applications. Thus, scheduling solutions are required to satisfy requests and obtain high observation efficiency. While the literature on multi-satellite scheduling is rich, most solutions are centralized algorithms. However, due to their cost, EOS systems are often co-funded by several agents (e.g., countries, companies, or research institutes). Central solutions require that these agents share their requests for observations with others. To date, there has yet to be a solution for EOS scheduling that protects the private information of the interested parties. In this study, we model the EOS scheduling problem as a distributed constraint optimization problem (DCOP). This modeling enables the generation of timetables for the satellites in a distributed manner without a priori sharing users’ private information with some central authority. For solving the resulting DCOP, we use and compare the results of two different local search algorithms—Distributed Stochastic Algorithm and Maximum Gain Message—which are known to produce efficient solutions in a timely manner. The modeling and solving of the resulting DCOP constitute our new solution method, which we term Distributed Satellite Timetable Solver (DSTS). Experimental evaluation reveals that the DSTS method provides solutions of higher quality than a commonly used centralized greedy algorithm and is comparable to an additional centralized algorithm that we propose.
- 7 October 2024
- Published by Springer Nature in Journal of Scheduling
- Vol. 27 (5) , 507-524
Open AccessScheduling of Earth observing satellites using distributed constraint optimization
Earth observation satellites (EOS) are satellites equipped with optical sensors that orbit the Earth to take photographs of particular areas at the request of users. With the development of space technology, the number of satellites has increased continuously. Yet still, the number of satellites cannot meet the explosive growth of applications. Thus, scheduling solutions are required to satisfy requests and obtain high observation efficiency. While the literature on multi-satellite scheduling is rich, most solutions are centralized algorithms. However, due to their cost, EOS systems are often co-funded by several agents (e.g., countries, companies, or research institutes). Central solutions require that these agents share their requests for observations with others. To date, there has yet to be a solution for EOS scheduling that protects the private information of the interested parties. In this study, we model the EOS scheduling problem as a distributed constraint optimization problem (DCOP). This modeling enables the generation of timetables for the satellites in a distributed manner without a priori sharing users’ private information with some central authority. For solving the resulting DCOP, we use and compare the results of two different local search algorithms—Distributed Stochastic Algorithm and Maximum Gain Message—which are known to produce efficient solutions in a timely manner. The modeling and solving of the resulting DCOP constitute our new solution method, which we term Distributed Satellite Timetable Solver (DSTS). Experimental evaluation reveals that the DSTS method provides solutions of higher quality than a commonly used centralized greedy algorithm and is comparable to an additional centralized algorithm that we propose.
- Open Access
- 30 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules
Electronic voting systems have significant advantages in comparison with physical voting systems. One of the main challenges in e-voting systems is to secure the voting process: namely, to certify that the computed results are consistent with the cast ballots and that the voters’ privacy is preserved. We propose herein a secure voting protocol for elections that are governed by order-based voting rules. Our protocol offers perfect ballot secrecy in the sense that it issues only the required output while no other information on the cast ballots is revealed. Such perfect secrecy, achieved by employing secure multiparty computation tools, may increase the voters’ confidence and, consequently, encourage them to vote according to their true preferences. Evaluation of the protocol’s computational costs establishes that it is lightweight and can be readily implemented in real-life electronic elections.
- 30 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessTowards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules
Electronic voting systems have significant advantages in comparison with physical voting systems. One of the main challenges in e-voting systems is to secure the voting process: namely, to certify that the computed results are consistent with the cast ballots and that the voters’ privacy is preserved. We propose herein a secure voting protocol for elections that are governed by order-based voting rules. Our protocol offers perfect ballot secrecy in the sense that it issues only the required output while no other information on the cast ballots is revealed. Such perfect secrecy, achieved by employing secure multiparty computation tools, may increase the voters’ confidence and, consequently, encourage them to vote according to their true preferences. Evaluation of the protocol’s computational costs establishes that it is lightweight and can be readily implemented in real-life electronic elections.