SearcharxivSearch

arXiv subjects

Saswati Sarkar

Publications and source records attributed to Saswati Sarkar.

At least 19 recordsLinked to original sources

Steering the Herd: A Framework for LLM-based Control of Social Learning

Algorithms increasingly serve as information mediators--from social media feeds and targeted advertising to the increasing ubiquity of LLMs. This engenders a joint process where agents combine private, algorithmically-mediated signals with learning from peers to arrive at decisions. To study such settings, we introduce a model of controlled sequential social learning in which an information-mediating planner (e.g. an LLM) controls the information structure of agents while they also learn from the decisions of earlier agents. The planner may seek to improve social welfare (altruistic planner) or to induce a specific action the planner prefers (biased planner). Our framework presents a new optimization problem for social learning that combines dynamic programming with decentralized action choices and Bayesian belief updates. We prove the convexity of the value function and characterize the optimal policies of altruistic and biased planners, which attain desired tradeoffs between the costs they incur and the payoffs they earn from induced agent choices. Notably, in some regimes the biased planner intentionally obfuscates the agents' signals. Even under stringent transparency constraints--information parity with individuals, no lying or cherry-picking, and full observability--we show that information mediation can substantially shift social welfare in either direction. We complement our theory with simulations in which LLMs act as both planner and agents. Notably, the LLM planner in our simulations exhibits emergent strategic behavior in steering public opinion that broadly mirrors the trends predicted, though key deviations suggest the influence of non-Bayesian reasoning consistent with the cognitive patterns of both humans and LLMs trained on human-like data. Together, we establish our framework as a tractable basis for studying the impact and regulation of LLM information mediators.

eess.SY

Group Testing with General Correlation Using Hypergraphs

Group testing, a problem with diverse applications across multiple disciplines, traditionally assumes independence across nodes' states. Recent research, however, focuses on real-world scenarios that often involve correlations among nodes, challenging the simplifying assumptions made in existing models. In this work, we consider a comprehensive model for arbitrary statistical correlation among nodes' states. To capture and leverage these correlations effectively, we model the problem by hypergraphs, inspired by [GLS22], augmented by a probability mass function on the hyper-edges. Using this model, we first design a novel greedy adaptive algorithm capable of conducting informative tests and dynamically updating the distribution. Performance analysis provides upper bounds on the number of tests required, which depend solely on the entropy of the underlying probability distribution and the average number of infections. We demonstrate that the algorithm recovers or improves upon all previously known results for group testing settings with correlation. Additionally, we provide families of graphs where the algorithm is order-wise optimal and give examples where the algorithm or its analysis is not tight. We then generalize the proposed framework of group testing with general correlation in two directions, namely noisy group testing and semi-non-adaptive group testing. In both settings, we provide novel theoretical bounds on the number of tests required.

cs.IT

Containing a spread through sequential learning: to exploit or to explore?

The spread of an undesirable contact process, such as an infectious disease (e.g. COVID-19), is contained through testing and isolation of infected nodes. The temporal and spatial evolution of the process (along with containment through isolation) render such detection as fundamentally different from active search detection strategies. In this work, through an active learning approach, we design testing and isolation strategies to contain the spread and minimize the cumulative infections under a given test budget. We prove that the objective can be optimized, with performance guarantees, by greedily selecting the nodes to test. We further design reward-based methodologies that effectively minimize an upper bound on the cumulative infections and are computationally more tractable in large networks. These policies, however, need knowledge about the nodes' infection probabilities which are dynamically changing and have to be learned by sequential testing. We develop a message-passing framework for this purpose and, building on that, show novel tradeoffs between exploitation of knowledge through reward-based heuristics and exploration of the unknown through a carefully designed probabilistic testing. The tradeoffs are fundamentally distinct from the classical counterparts under active search or multi-armed bandit problems (MABs). We provably show the necessity of exploration in a stylized network and show through simulations that exploration can outperform exploitation in various synthetic and real-data networks depending on the parameters of the network and the spread.

cs.LG

Group Testing with Correlation under Edge-Faulty Graphs

In applications of group testing in networks, e.g. identifying individuals who are infected by a disease spread over a network, exploiting correlation among network nodes provides fundamental opportunities in reducing the number of tests needed. We model and analyze group testing on $n$ correlated nodes whose interactions are specified by a graph $G$. We model correlation through an edge-faulty random graph formed from $G$ in which each edge is dropped with probability $1-r$, and all nodes in the same component have the same state. We consider three classes of graphs: cycles and trees, $d$-regular graphs and stochastic block models or SBM, and obtain lower and upper bounds on the number of tests needed to identify the defective nodes. Our results are expressed in terms of the number of tests needed when the nodes are independent and they are in terms of $n$, $r$, and the target error. In particular, we quantify the fundamental improvements that exploiting correlation offers by the ratio between the total number of nodes $n$ and the equivalent number of independent nodes in a classic group testing algorithm. The lower bounds are derived by illustrating a strong dependence of the number of tests needed on the expected number of components. In this regard, we establish a new approximation for the distribution of component sizes in "$d$-regular trees" which may be of independent interest and leads to a lower bound on the expected number of components in $d$-regular graphs. The upper bounds are found by forming dense subgraphs in which nodes are more likely to be in the same state. When $G$ is a cycle or tree, we show an improvement by a factor of $log(1/r)$. For grid, a graph with almost $2n$ edges, the improvement is by a factor of ${(1-r) \log(1/r)}$, indicating drastic improvement compared to trees. When $G$ has a larger number of edges, as in SBM, the improvement can scale in $n$.

cs.IT

The Interplay of Competition and Cooperation Among Service Providers (Part I)

This paper investigates the incentives of mobile network operators (MNOs) for acquiring additional spectrum to offer mobile virtual network operators (MVNOs) and thereby inviting competition for a common pool of end users (EUs). We consider a base case and two generalizations: (i) one MNO and one MVNO, (ii) one MNO, one MVNO and an outside option, and (iii) two MNOs and one MVNO. In each of these cases, we model the interactions of the service providers (SPs) using a sequential game, identify when the Subgame Perfect Nash Equilibrium (SPNE) exists, when it is unique and characterize the SPNE when it exists. The characterizations are easy to compute, and are in closed form or involve optimizations in only one decision variable. We identify metrics to quantify the interplay between cooperation and competition, and evaluate those as also the SPNEs to show that cooperation between MNO and MVNO can enhance the payoffs of both, while increased competition due to the presence of additional MNOs is beneficial to EUs but reduces the payoffs of the SPs.

cs.NI

The Interplay of Competition and Cooperation Among Service Providers (Part II)

This paper investigates the incentives of mobile network operators (MNOs) for acquiring additional spectrum to offer mobile virtual network operators (MVNOs) and thereby inviting competition for a common pool of end users (EUs). We consider interactions between two service providers, an MNO and an MVNO, when the EUs 1) must choose one of them 2) have the option to defect to an outside option should the SP duo offer unsatisfactory access fees or qualities of service. We formulate a multi-stage hybrid of cooperative bargaining and non-cooperative games in which the two SPs jointly determine their spectrum acquisitions, allocations and mutual money flows through the bargaining game, and subsequently individually determine the access fees for the EUs through the non-cooperative game. We identify when the overall equilibrium solutions exist, when it is unique and characterize the equilibrium solutions when they exist. The characterizations are easy to compute, and are in closed form or involve optimizations in only one decision variable. The hybrid framework allows us to determine whether and by how much the different entities benefit due to the cooperation in spectrum acquisition decision.

cs.GT

Is Non-Neutrality Profitable for the Stakeholders of the Internet Market?

Net neutrality on the Internet is perceived as the policy that mandates Internet Service Providers (ISPs) to treat all data equally, regardless of the source, destination, or type of transmitted data. In this work, we consider a scheme in which the decision makers of the market are two ISPs, one "big" Content Provider (CP), and a continuum of end-users. One of the ISPs is neutral and the other is non-neutral, i.e. she offers a premium quality to a CP in exchange for a side-payment. In addition, we assume that the CP can differentiate between ISPs by controlling the quality of the content she is offering on each one. In this part of the paper, we consider a scenario in which end-users are not locked in with the ISPs and can switch between ISPs easily. We formulate a sequential game, and show that there exists a unique Sub-game Perfect Nash Equilibrium (SPNE) for the game, where the CP pays the side-payment to the non-neutral ISP and offers her content with the premium quality. In addition, the CP does not offer her content on the neutral ISP. Thus, driving this ISP out of the market.

cs.GT

Modeling Information Propagation in General V2V-enabled Transportation Networks

V2V technologies bridge two infrastructures: the communications infrastructure and the transportation infrastructure. These infrastructures are interconnected and interdependent. On the one hand, the communications network enables V2V interactions, while, on the other hand, the density of vehicles on the roadway enabled with V2V and the level of congestion on the roadway determine the speed and quality of communications between vehicles and infrastructure. The V2V technology is expected to contribute significantly to the growth of shared mobility, in turn, receives a significant boost from the deployment of a large number of connected vehicles in shared mobility services, provided challenges towards the deployment can be overcome. Vehicle mobility patterns and communication conditions are not only heterogeneous, but they also evolve constantly, leading to dynamic coupling between the communication and the transportation infrastructure. We consider the communication of messages amongst the vehicles in a transportation network, and estimate how quickly messages spread under different conditions of traffic density (traffic congestion, the presence of an accident, and time of day such as morning and evening rush hour) and communication conditions. We developed a continuous-time Markov chain to describe the information propagation process through enabled vehicles. Our models converge to a solution of a set of clustered epidemiological differential equations which lend itself to fast computation. We then demonstrate the applicability of this model in various scenarios: both real-world scenarios and hypothesized scenarios of outages and system perturbations. We find that our models match actual trajectory data with very little error, demonstrating the applicability of our models to study the spread of information through a network of connected vehicles.

cs.SI

Spread, then Target, and Advertise in Waves: Optimal Budget Allocation Across Advertising Channels

We analyze optimal strategies for the allocation of a finite budget that can be invested in different advertising channels over time with the objective of influencing social opinions in a network of individuals. In our analysis, we consider both exogenous influence mechanisms, such as advertising campaigns, as well as endogenous mechanisms of social influence, such as word-of-mouth and peer-pressure, which are modeled using diffusion dynamics. We show that for a broad family of objective functions, the optimal influence strategy at every time uses all channels at either their maximum rate or not at all, i.e., a bang-bang strategy. Furthermore, we prove that the number of switches between these extremes is bounded above by a term that is typically much smaller than the number of agents. This means that the optimal influence strategy is to exert maximum effort in waves for every channel, and then cease effort and let the effects propagate. We also show that, at the beginning of the campaign, the total cost-adjusted reach of an exogenous advertising channel determines its relative value. In contrast, as we approach our investment horizon (e.g., election day), the optimal strategy is to invest in channels able to target individuals instead of broad-reaching channels. We demonstrate that the optimal influence strategies are easily computable in several practical cases, and explicitly characterize the optimal controls for the case of linear objective functions in closed form. Finally, we see that, in the canonical example of designing an election campaign, identifying late-deciders is a critical component in the optimal design.

math.OC

Is Non-Neutrality Profitable for the Stakeholders of the Internet Market? - Part II

In this part of the paper, we obtain analytical results for the case that transport costs are not small (complement of Part I), and combine them with the results in Part I of the paper to provide general results for all values of transport costs. We show that, in general, if an SPNE exists, it would be one of the five possible strategies each of which we explicitly characterize. We also prove that when EUs have sufficiently high inertia for at least one of the ISPs, there exists a unique SPNE with a non-neutral outcome in which both of the ISPs are active, and the CP offers her content with free quality on the neutral ISP and with premium quality on the non-neutral ISP. Moreover, we show that an SPNE does not always exist. We also analyze a benchmark case in which both ISPs are neutral, and prove that there exists a unique SPNE in which the CP offers her content with free quality on both ISPs, and both ISPs are active. We also provide extensive numerical results and discussions for all ranges of transport costs. Simulation results suggest that if the SPNE exists, it would be unique. In addition, results reveal that the neutral ISP receives a lower payoff and the non-neutral ISP receives a higher payoff (most of the time) in a non-neutral scenario. However, we also identify scenarios in which the non-neutral ISP loses payoff by adopting non-neutrality. In addition, we show that a non-neutral regime yields a higher welfare for EUs than a neutral one if the market power of the non-neutral ISP is small, the sensitivity of EUs (respectively, the CP) to the quality is low (respectively, high), or a combinations of these factors.

cs.GT

The Interplay of Competition and Cooperation Among Service Providers

We consider the economics of the interaction between Mobile Virtual Network Operators (MVNOs) and Mobile Network Operators (MNOs). We investigate the incentives of an MNO for offering some of her resources to an MVNO instead of using the resources for her own End-Users (EUs). We consider a market with one MNO and one MVNO, and a continuum of undecided EUs. Two cases for EUs are considered: (i) when EUs need to choose either the MNO or the MVNO, and (ii) when EUs have an outside option. In each of these cases, we consider a non-cooperative framework of sequential game and a cooperative framework of bargaining game. We characterize the Subgame Perfect Nash Equilibria (SPNE) and Nash Bargaining Solution (NBS) of the sequential and bargaining games, respectively. We show that in the non-cooperative framework, SPNE assumes two forms: (i) the MNO invests minimally on her infrastructure and the MVNO leases all the newly invested resources and (ii) the MNO invests more on her infrastructure, the MVNO leases only part of these resources to the MVNO, and the MNO uses the rest herself to attract EUs. Thus, in both, the MNO generates revenue indirectly through the MVNO. In addition to that, in (ii), the MNO generates revenue directly from the EUs. We also prove that in the bargaining framework, the MVNO either reserves all the resources or no resources from the MNO, and the MNO's investments are guided by whether EUs have an outside option. If they don't, then the MNO invests as little as possible on her infrastructure. If they do, then the MNO invests more.

cs.GT

The Economics of Competition and Cooperation Between MNOs and MVNOs

In this work, we consider the economics of the interaction between Mobile Virtual Network Operators (MVNOs) and Mobile Network Operators (MNOs). We investigate the incentives of an MNO for offering some of her resources to an MVNO instead of using the resources for her own. We formulate the problem as a sequential game. We consider a market with one MNO and one MVNO, and a continuum of undecided end-users. We assume that EUs have different preferences for the MNO and the MVNO. These preferences can be because of the differences in the service they are offering or the reluctance of an EU to buy her plan from one of them. We assume that the preferences also depend on the investment level the MNO and the MVNO. We show that there exists a unique interior SPNE, i.e. the SPNE by which both SPs receive a positive mass of EUs, and characterize it. We also consider a benchmark case in which the MNO and the MVNO do not cooperate, characterize the unique SPNE of this case, and compare the results of our model to the benchmark case to assess the incentive of the MNO to invest in her infrastructure and to offer it to the MVNO.

cs.NI

Visibility-Aware Optimal Contagion of Malware Epidemics

Recent innovations in the design of computer viruses have led to new trade-offs for the attacker. Multiple variants of a malware may spread at different rates and have different levels of visibility to the network. In this work we examine the optimal strategies for the attacker so as to trade off the extent of spread of the malware against the need for stealth. We show that in the mean-field deterministic regime, this spread-stealth trade-off is optimized by computationally simple single-threshold policies. Specifically, we show that only one variant of the malware is spread by the attacker at each time, as there exists a time up to which the attacker prioritizes maximizing the spread of the malware, and after which she prioritizes stealth.

cs.CR

The value of Side Information in Secondary Spectrum Markets

In a secondary spectrum market primaries set prices for their unused channels to the secondaries. The payoff of a primary depends on the availability of unused channels of its competitors. We consider a model were a primary can acquire its competitor's channel state information (C-CSI) at a cost. We formulate a game between two primaries where each primary decides whether to acquire C-CSI or not and then selects its price based on that. We first characterize the Nash Equilibrium (NE) of this game for a symmetric model where the C-CSI is perfect. We show that the payoff of a primary is independent of the C-CSI acquisition cost. We then generalize our analysis to allow for imperfect estimation and cases where the two primaries have different C-CSI costs or different channel availabilities. Our results show interestingly that the payoff of a primary increases when there is estimation error. We also show that surprisingly, the expected payoff of a primary may decrease when the C-CSI acquisition cost decreases when primaries have different availabilities.

cs.GT

The Economics of Quality Sponsored Data in Non-Neutral Networks

The growing demand for data has driven the Service Providers (SPs) to provide differential treatment of traffic to generate additional revenue streams from Content Providers (CPs). While SPs currently only provide best-effort services to their CPs, it is plausible to envision a model in near future, where CPs are willing to sponsor quality of service for their content in exchange of sharing a portion of their profit with SPs. This quality sponsoring becomes invaluable especially when the available resources are scarce such as in wireless networks, and can be accommodated in a non-neutral network. In this paper, we consider the problem of Quality-Sponsored Data (QSD) in a non-neutral network. In our model, SPs allow CPs to sponsor a portion of their resources, and price it appropriately to maximize their payoff. The payoff of the SP depends on the monetary revenue and the satisfaction of end-users both for the non-sponsored and sponsored content, while CPs generate revenue through advertisement. We analyze the market dynamics and equilibria in two different frameworks, i.e. sequential and bargaining game frameworks, and provide strategies for (i) SPs: to determine if and how to price resources, and (ii) CPs: to determine if and what quality to sponsor. The frameworks characterize different sets of equilibrium strategies and market outcomes depending on the parameters of the market.

cs.NI

Strategic Interaction Among Different Entities in Internet of Things

The economic model of the Internet of Things (IoT) consists of end users, advertisers and three different kinds of providers--IoT service provider (IoTSP), Wireless service provider (WSP) and cloud service provider (CSP). We investigate three different kinds of interactions among the providers. First, we consider that the IoTSP prices a bundled service to the end-users, and the WSP and CSP pay the IoTSP (push model). Next, we consider the model where the end-users independently pay the each provider (pull model). Finally, we consider a hybrid model of the above two where the IoTSP and WSP quote their prices to the end-users, but the CSP quotes its price to the IoTSP. We characterize and quantify the impact of the advertisement revenue on the equilibrium pricing strategy and payoff of providers, and corresponding demands of end users in each of the above interaction models. Our analysis reveals that the demand of end-users, and the payoffs of the providers are non decreasing functions of the advertisement revenue. For sufficiently high advertisement revenue, the IoTSP will offer its service free of cost in each interaction model. However, the payoffs of the providers, and the demand of end-users vary across different interaction models. Our analysis shows that the demand of end-users, and the payoff of the WSP are the highest in the pull (push, resp.) model in the low (high, resp.) advertisement revenue regime. The payoff of the IoTSP is always higher in the pull model irrespective of the advertisement revenue. The payoff of the CSP is the highest in the hybrid model in the low advertisement revenue regime. However, in the high advertisement revenue regime the payoff of the CSP in the hybrid model or in the push model can be higher depending on the equilibrium chosen in the push model.

cs.GT

Uncertain Price Competition in a Duopoly with Heterogeneous Availability

We study the price competition in a duopoly with an arbitrary number of buyers. Each seller can offer multiple units of a commodity depending on the availability of the commodity which is random and may be different for different sellers. Sellers seek to select a price that will be attractive to the buyers and also fetch adequate profits. The selection will in general depend on the number of units available with the seller and also that of its competitor - the seller may only know the statistics of the latter. The setting captures a secondary spectrum access network, a non-neutral Internet, or a microgrid network in which unused spectrum bands, resources of ISPs, and excess power units constitute the respective commodities of sale. We analyze this price competition as a game, and identify a set of necessary and sufficient properties for the Nash Equilibrium (NE). The properties reveal that sellers randomize their price using probability distributions whose support sets are mutually disjoint and in decreasing order of the number of availability. We prove the uniqueness of a symmetric NE in a symmetric market, and explicitly compute the price distribution in the symmetric NE.

cs.GT

Optimal Energy-Aware Epidemic Routing in DTNs

In this work, we investigate the use of epidemic routing in energy constrained Delay Tolerant Networks (DTNs). In epidemic routing, messages are relayed by intermediate nodes at contact opportunities, i.e., when pairs of nodes come within the transmission range of each other. Each node needs to decide whether to forward its message upon contact with a new node based on its own residual energy level and the age of that message. We mathematically characterize the fundamental trade-off between energy conservation and a measure of Quality of Service as a dynamic energy-dependent optimal control problem. We prove that in the mean-field regime, the optimal dynamic forwarding decisions follow simple threshold-based structures in which the forwarding threshold for each node depends on its current remaining energy. We then characterize the nature of this dependence. Our simulations reveal that the optimal dynamic policy significantly outperforms heuristics.

eess.SY