Search
Now showing items 1-10 of 133
Algorithms for Geometric Packing and Covering Problems
We study two fundamental problems related to geometric packing and covering, and design
algorithms with improved worst-case performance guarantees for them. These problems have
numerous applications in resource allocation, ...
Temporal Point Processes for Forecasting Events in Higher-Order Networks
Real-world systems consisting of interacting entities can be effectively represented as time-evolving networks or graphs, where the entities are depicted as nodes, and the interactions between them are represented as ...
Novel Algorithms for Improving Agricultural Planning and Operations using Artificial Intelligence and Game Theory
This dissertation work is motivated by the critical need to address a perennial global problem, namely, how to mitigate the distress of the small and marginal agricultural farmers in emerging economies. Key reasons behind ...
Mean Field Based Investigations for Inducing Socially Optimal Epidemic Behavior in Rational Individuals
In the recent years, the world has been devastated by multiple pandemics arising out of different variants of the Corona virus. When an epidemic or pandemic strikes, it is important to move quickly to contain and suppress ...
Barrier Function Inspired Reward Shaping in Reinforcement Learning
Reinforcement Learning (RL) has progressed from simple control tasks to complex real-world challenges with large state spaces. During initial iterations of training in most Reinforcement Learning (RL) algorithms, agents ...
Exploring Fairness and Causality in Online Decision-Making
Online decision-making under uncertainty is a fundamental aspect of numerous real-world problems across various domains, including online resource allocation, crowd-sourcing, and online advertising. Multi-Armed Bandits ...
Topological Structures and Operators for Bivariate Data Visualization
Understanding complex phenomena in diverse scientific and engineering disciplines often relies on decoding the interplay among real-valued or scalar fields that are measured or computed over a spatial domain. This thesis ...
Bandit Algorithms: Fairness, Welfare, and Applications in Causal Inference
We study regret in online learning from a welfarist perspective and explore an application of
bandit algorithms in causal inference. We introduce Nash regret, which measures the difference
between the optimal action ...
Rational Secure Computation: New Definitions and Constructions
Cryptography and Game Theory are two fascinating areas of modern computing, and there have been numerous works since the early 2000s to bridge these. While cryptography provides mechanisms to detect deviations, game theory ...
An Explainable Hierarchical Class Attention Model for Legal Appeal Automation
Judicial systems worldwide are overburdened due to the limited number of legal professionals.
The digitization of legal processes has resulted in abundant legal data, paving the way for the
development of legal automation ...

