S. Rasoul Etesami
YOU?
Author Swipe
View article: A Fixed Point Framework for the Existence of EFX Allocations
A Fixed Point Framework for the Existence of EFX Allocations Open
We consider the problem of the existence of an envy-free allocation up to any good (EFX) for linear valuations and establish new results by connecting this problem to a fixed point framework. Specifically, we first use randomized rounding …
View article: The 2R-Conjecture for the Hegselmann--Krause Model: A Proof in Expectation and New Directions
The 2R-Conjecture for the Hegselmann--Krause Model: A Proof in Expectation and New Directions Open
Hegselmann--Krause models are localized, distributed averaging dynamics on spatial data. A key aspect of these dynamics is that they lead to cluster formation, which has important applications in geographic information systems, dynamic clu…
View article: Dynamic batching of online arrivals to leverage economies of scale
Dynamic batching of online arrivals to leverage economies of scale Open
View article: Distributed Nash Equilibrium Seeking in Non-Monotone Games over the Simplex
Distributed Nash Equilibrium Seeking in Non-Monotone Games over the Simplex Open
In this work, we present a novel characterization of approximate Nash equilibria in a class of convex games over the simplex. To achieve this, we regularize the utility functions using the Shannon entropy term, connect the solutions to the…
View article: Online Learning for Dynamic Vickrey-Clarke-Groves Mechanism in Unknown Environments
Online Learning for Dynamic Vickrey-Clarke-Groves Mechanism in Unknown Environments Open
We consider the problem of online dynamic mechanism design for sequential auctions in unknown environments, where the underlying market and, thus, the bidders' values vary over time as interactions between the seller and the bidders progre…
View article: Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach
Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach Open
We consider the problem of learning stable matchings with unknown preferences in a decentralized and uncoordinated manner, where ``decentralized" means that players make decisions individually without the influence of a central platform, a…
View article: A Game-Theoretic Framework for Distributed Load Balancing: Static and Dynamic Game Models
A Game-Theoretic Framework for Distributed Load Balancing: Static and Dynamic Game Models Open
Motivated by applications in job scheduling, queuing networks, and load balancing in cyber-physical systems, we develop and analyze a game-theoretic framework to balance the load among servers in static and dynamic settings. In these appli…
View article: FaithfulPersona: Balancing Faithfulness and Personalization in Code Explanations through Self-Critique
FaithfulPersona: Balancing Faithfulness and Personalization in Code Explanations through Self-Critique Open
View article: From Critique to Clarity: A Pathway to Faithful and Personalized Code Explanations with Large Language Models
From Critique to Clarity: A Pathway to Faithful and Personalized Code Explanations with Large Language Models Open
In the realm of software development, providing accurate and personalized code explanations is crucial for both technical professionals and business stakeholders. Technical professionals benefit from enhanced understanding and improved pro…
View article: Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach
Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach Open
We consider the problem of learning stable matchings with unknown preferences in a decentralized and uncoordinated manner, where "decentralized" means that players make decisions individually without the influence of a central platform, an…
View article: Maximizing Social Welfare Subject to Network Externalities: A Unifying Submodular Optimization Approach
Maximizing Social Welfare Subject to Network Externalities: A Unifying Submodular Optimization Approach Open
We consider the problem of allocating multiple indivisible items to a set of networked agents to maximize the social welfare subject to network effects (externalities). Here, the social welfare is given by the sum of agents' utilities and …
View article: Optimizing Profitability in Timely Gossip Networks
Optimizing Profitability in Timely Gossip Networks Open
We consider a communication system where a group of users, interconnected in a bidirectional gossip network, wishes to follow a time-varying source, e.g., updates on an event, in real-time. The users wish to maintain their expected version…
View article: How to Make Money From Fresh Data: Subscription Strategies in Age-Based Systems
How to Make Money From Fresh Data: Subscription Strategies in Age-Based Systems Open
We consider a communication system consisting of a server that tracks and publishes updates about a time-varying data source or event, and a gossip network of users interested in closely tracking the event. The timeliness of the informatio…
View article: Learning How to Strategically Disclose Information
Learning How to Strategically Disclose Information Open
Strategic information disclosure, in its simplest form, considers a game between an information provider (sender) who has access to some private information that an information receiver is interested in. While the receiver takes an action …
View article: The Role of Gossiping in Information Dissemination over a Network of Agents
The Role of Gossiping in Information Dissemination over a Network of Agents Open
We consider information dissemination over a network of gossiping agents. In this model, a source keeps the most up-to-date information about a time-varying binary state of the world, and n receiver nodes want to follow the information at …
View article: Scalable and Independent Learning of Nash Equilibrium Policies in $n$-Player Stochastic Games with Unknown Independent Chains
Scalable and Independent Learning of Nash Equilibrium Policies in $n$-Player Stochastic Games with Unknown Independent Chains Open
We study a subclass of $n$-player stochastic games, namely, stochastic games with independent chains and unknown transition matrices. In this class of games, players control their own internal Markov chains whose transitions do not depend …
View article: Dynamic Batching of Online Arrivals to Leverage Economies of Scale
Dynamic Batching of Online Arrivals to Leverage Economies of Scale Open
Many settings, such as matching riders to drivers in ride-hailing platforms or in-stream video advertising, require handling arrivals over time. In such applications, it is often beneficial to group the arriving orders or requests into bat…
View article: Online and Offline Dynamic Influence Maximization Games Over Social Networks
Online and Offline Dynamic Influence Maximization Games Over Social Networks Open
In this work, we consider dynamic influence maximization games over social networks with multiple players (influencers). The goal of each influencer is to maximize their own reward subject to their limited total budget rate constraints. Th…
View article: Online Reinforcement Learning in Markov Decision Process Using Linear Programming
Online Reinforcement Learning in Markov Decision Process Using Linear Programming Open
We consider online reinforcement learning in episodic Markov decision process (MDP) with unknown transition function and stochastic rewards drawn from some fixed but unknown distribution. The learner aims to learn the optimal policy and mi…
View article: Robustness of Dynamics in Games: A Contraction Mapping Decomposition Approach
Robustness of Dynamics in Games: A Contraction Mapping Decomposition Approach Open
A systematic framework for analyzing dynamical attributes of games has not been well-studied except for the special class of potential or near-potential games. In particular, the existing results have shortcomings in determining the asympt…
View article: Partisan Confidence Model for Group Polarization
Partisan Confidence Model for Group Polarization Open
Models of opinion dynamics play a major role in various disciplines, including economics, political science, psychology, and social science, as they provide a framework for analysis and intervention. In spite of the numerous mathematical m…
View article: Distributed Computation for the Non-metric Data Placement Problem using Glauber Dynamics and Auctions
Distributed Computation for the Non-metric Data Placement Problem using Glauber Dynamics and Auctions Open
We consider the non-metric data placement problem and develop distributed algorithms for computing or approximating its optimal integral solution. We first show that the non-metric data placement problem is inapproximable up to a logarithm…
View article: Limited-Trust in Diffusion of Competing Alternatives over Social Networks
Limited-Trust in Diffusion of Competing Alternatives over Social Networks Open
We consider the diffusion of two alternatives in social networks using a game-theoretic approach. Each individual plays a coordination game with its neighbors repeatedly and decides which to adopt. As products are used in conjunction with …
View article: The Role of Local Steps in Local SGD
The Role of Local Steps in Local SGD Open
We consider the distributed stochastic optimization problem where $n$ agents want to minimize a global function given by the sum of agents' local functions, and focus on the heterogeneous setting when agents' local functions are defined ov…
View article: Faster Convergence of Local SGD for Over-Parameterized Models
Faster Convergence of Local SGD for Over-Parameterized Models Open
Modern machine learning architectures are often highly expressive. They are usually over-parameterized and can interpolate the data by driving the empirical loss close to zero. We analyze the convergence of Local SGD (or FedAvg) for such o…
View article: Learning Stationary Nash Equilibrium Policies in $n$-Player Stochastic Games with Independent Chains
Learning Stationary Nash Equilibrium Policies in $n$-Player Stochastic Games with Independent Chains Open
We consider a subclass of $n$-player stochastic games, in which players have their own internal state/action spaces while they are coupled through their payoff functions. It is assumed that players' internal chains are driven by independen…
View article: The Role of Gossiping for Information Dissemination over Networked Agents
The Role of Gossiping for Information Dissemination over Networked Agents Open
We consider information dissemination over a network of gossiping agents (nodes). In this model, a source keeps the most up-to-date information about a time-varying binary state of the world, and $n$ receiver nodes want to follow the infor…
View article: Open-Loop Equilibrium Strategies for Dynamic Influence Maximization Game Over Social Networks
Open-Loop Equilibrium Strategies for Dynamic Influence Maximization Game Over Social Networks Open
We consider the problem of budget allocation for competitive influence maximization over social networks. In this problem, multiple competing parties (players) want to distribute their limited advertising resources over a set of social ind…
View article: Partisan Confidence Model for Group Polarization
Partisan Confidence Model for Group Polarization Open
Models of opinion dynamics play a major role in various disciplines, including economics, political science, psychology, and social science, as they provide a framework for analysis and intervention. In spite of the numerous mathematical m…
View article: Open-Loop Equilibrium Strategies for Dynamic Influence Maximization Game\n Over Social Networks
Open-Loop Equilibrium Strategies for Dynamic Influence Maximization Game\n Over Social Networks Open
We consider the problem of budget allocation for competitive influence\nmaximization over social networks. In this problem, multiple competing parties\n(players) want to distribute their limited advertising resources over a set of\nsocial …