Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

6351,2691,9042,538 · Jun 202019922001200920172026
48 results for Social and individual regret

Optimistic Hedge achieves optimal regret bounds in two-player zero-sum games.

problem Achieving optimal regret bounds for optimistic Hedge in two-player zero-sum games.
method Refined regret analysis and optimization problem formulation.
result Optimistic Hedge achieves O(logmlogn)O(\sqrt{\log m \log n}) regret bounds, matching upper and lower bounds.

Framework for online resource allocation using social welfare functions.

problem Optimal allocation of resources over time steps in a population.
method Confidence sequence framework for SWF-based online learning and inference, valid for any monotonic, concave, and Lipschitz-continuous SWF.
result Achieves near-optimal regret of ildeO(n+nkT) ilde{O}(n+\sqrt{nkT}) for SWF-agnostic algorithm SWF-UCB.

We consider a collaborative online learning paradigm, wherein a group of agents connected through a social network are engaged in playing a stochastic multi-armed bandit game. Each time an agent takes an action, the corresponding reward is instantaneously observed by the agent, as well as its neighbours in the social n…

2016-02-29abs ↗pdf ↗

The paper tackles fair policy targeting by optimizing allocation rules to minimize unfairness.

problem Discrimination in individualized treatments of social welfare programs.
method Formulated as a mixed-integer linear program, solved using off-the-shelf algorithms, derived regret bounds and small sample guarantees.
result Designs fair and efficient treatment allocation rules within the Pareto frontier.

Social learning can make financial markets inefficient, but individual learning can fix this.

problem Inefficiencies in financial markets due to social learning.
method Study of the Minority Game model with social and individual learning mechanisms.
result Individual learning can rescue a population from the inefficiencies caused by social learning.

Paper presents a privacy-preserving algorithm for estimating peer effects using the Ising model.

problem Privacy concerns in estimating peer effects using network data.
method Developed a (ε,δ)(\varepsilon,δ)-differentially private algorithm using Ising model.
result Established regret bounds and validated performance on synthetic and real-world networks.

Develops a personalized reinforcement learning algorithm for dyadic health interventions.

problem Personalizing health interventions for dyadic relationships in mobile health.
method Dyadic Reinforcement Learning (dyadic RL), a Bayesian and hierarchical online algorithm.
result Established a regret bound and demonstrated empirical performance through simulations and real data.

Social media reduces individual investors' disposition effect through negative information.

problem The disposition effect in individual investors selling profitable assets too early and holding onto losing assets for too long.
method Analysis of post data and trading data from Xueqiu.com.
result Social media information significantly reduces the disposition effect.

Cascading chains of events are a salient feature of many real-world social, biological, and financial networks. In social networks, social reciprocity accounts for retaliations in gang interactions, proxy wars in nation-state conflicts, or Internet memes shared via social media. Neuron spikes stimulate or inhibit spike…

2014-08-29abs ↗pdf ↗

New algorithm reduces regret in multi-agent bandits with malicious agents.

problem Collaboration between honest and malicious agents in multi-armed bandits.
method Dynamic reduction of communication with malicious agents, learning who is malicious.
result Algorithm reduces regret even with a single malicious agent, assuming mm is small compared to KK.

This work addresses causal inference challenges in networked interference and proposes GNN-based estimators for individual treatment effects.

problem Estimating individual treatment effects in randomized experiments with networked interference.
method Uses Graph Neural Networks (GNNs) to capture network dependencies and derive causal effect estimators.
result Provides policy regret bounds and heuristic error bounds for GNN-based causal estimators under network interference and treatment capacity constraints.

This paper tackles no-regret learning for fair multi-agent social welfare optimization.

problem Maximizing social welfare in a fair manner for multiple agents.
method Developed algorithms for stochastic and adversarial multi-agent settings, proving regret bounds and tightness.
result Achieved no-regret learning for fair multi-agent social welfare optimization in various settings.

This paper addresses the problem of online learning in a dynamic setting. We consider a social network in which each individual observes a private signal about the underlying state of the world and communicates with her neighbors at each time period. Unlike many existing approaches, the underlying state is dynamic, and…

2013-10-01abs ↗pdf ↗

Study shows how competition affects learning in matching markets, proving it's possible to balance stability, fairness, and regret.

problem How competition affects learning in matching markets and the impossibility of simultaneously guaranteeing stability and low optimal regret.
method Modeling a two-sided matching market with bandit learners and adding components of costs and transfers.
result It is possible to simultaneously guarantee stability, low optimal regret, fairness in the distribution of regret, and high social welfare.

The paper tackles adaptive policy selection to maximize social welfare, achieving optimal regret bounds.

problem Maximizing social welfare through adaptive policy selection, considering both private utility and public revenue.
method The approach involves learning response functions through experimentation, deriving lower and upper bounds for regret, and using algorithms like Exp3.
result The algorithm achieves optimal regret bounds, showing that welfare maximization is harder than multi-armed bandit problems.

New algorithm reduces individual regret and communication costs in cooperative bandits.

problem Optimal individual and group regret in cooperative multi-agent bandits.
method Integrates a new communication policy into a learning algorithm.
result Achieves optimal individual regret and constant communication costs.

A new algorithm for social network recommendations using side-observations.

problem Designing recommendation algorithms for users influenced by their social network.
method Contextual bandits with side-observations modeled by a social network graph.
result The proposed algorithm achieves asymptotically optimal regret, matching the lower-bound as ToT o \infty.

Mechanism designs for unknown agent values in stochastic bandit settings.

problem Designing truthful mechanisms for maximizing social welfare in settings with unknown agent values and stochastic feedback.
method Developed a VCG-like mechanism with regret bounds for multi-round allocations, balancing agent and seller welfare.
result Achieved an $Ω(T^{ rac{2}{3}})$ lower bound for the maximum of welfare, agent utilities, and mechanism utility after TT rounds.

New algorithm for multi-player bandits with selfish players, achieving logarithmic regret.

problem Challenges of robustness to selfish players in multi-player bandits.
method First algorithm robust to selfish players achieving logarithmic regret, with or without collision observation.
result Achieved logarithmic regret for robust algorithms to selfish players in multi-player bandits.

This paper studies the problem of optimally allocating treatments in the presence of spillover effects, using information from a (quasi-)experiment. I introduce a method that maximizes the sample analog of average social welfare when spillovers occur. I construct semi-parametric welfare estimators with known and unknow…

2019-06-24abs ↗pdf ↗

Study on individual regret in cooperative MAB with agents communicating over a graph.

problem Individual regret in cooperative stochastic multi-armed bandits with communication constraints.
method Analyzed COOP-SE algorithm, derived individual regret bounds under various communication constraints.
result First to show an individual regret bound in cooperative stochastic MAB independent of graph diameter.

Social media has recently emerged as a premier method to disseminate information online. Through these online networks, tens of millions of individuals communicate their thoughts, personal experiences, and social ideals. We therefore explore the potential of social media to predict, even prior to onset, Major Depressiv…

2016-07-25abs ↗pdf ↗

We study agents communicating over an underlying network by exchanging messages, in order to optimize their individual regret in a common nonstochastic multi-armed bandit problem. We derive regret minimization algorithms that guarantee for each agent vv an individual expected regret of $\widetilde{O}\left(\sqrt{\left(…

2019-07-07abs ↗pdf ↗

Consequential decision-making typically incentivizes individuals to behave strategically, tailoring their behavior to the specifics of the decision rule. A long line of work has therefore sought to counteract strategic behavior by designing more conservative decision boundaries in an effort to increase robustness to th…

2018-08-25abs ↗pdf ↗

The rise in online social networking has brought about a revolution in social relations. However, its effects on offline interactions and its implications for collective well-being are still not clear and are under-investigated. We study the ecology of online and offline interaction in an evolutionary game framework wh…

2016-01-28abs ↗pdf ↗

The paper develops an economic foundation for multi-agent learning in markets.

problem Learning dynamics in markets with strategic externalities.
method A two-phase incentive mechanism that estimates and uses implementable transfers to steer long-run dynamics.
result The mechanism achieves sublinear social-welfare regret and asymptotically optimal welfare under mild rationality and exploration conditions.

New framework for online influencer selection considering cost constraints.

problem Real-world social advertising budget limitations and cost variability of influencers.
method Introduces a budgeted framework for online influence maximization using an algorithm with semi-bandit feedback.
result Improves the state of the art regret bound for cardinality constraint setting.

The study combines social interaction data into a single network, identifying stable groups of chimpanzees.

problem Identifying stable groups of chimpanzees based on social interactions over time.
method Network representation, weighted proximity weights, principled loss function, statistical tests.
result The approach detects stable groups of chimpanzees that stay related for a significant length of time.

New algorithm reduces regret in collaborative multi-agent bandit problems.

problem Optimizing decisions in a network of agents with communication delays.
method Follow-the-Regularized-Leader (FTRL) algorithm with suitable regularizers and communication protocols.
result Upper bound on individual regret matches lower bound up to a constant factor.

New method for online learning IC models with node-level feedback.

problem Learning IC models with node-level feedback in social networks.
method Detailed analysis and online algorithm with O(T)\mathcal{O}( \sqrt{T}) cumulative regret.
result First confidence-region result and online algorithm for IC models with node-level feedback.

The paper studies how noisy labels impact decision-making in machine learning.

problem The impact of noisy labels on decision-making in machine learning.
method Introducing a notion of regret, studying standard approaches, and estimating individual-level mistakes.
result Standard approaches can lead to unforeseen mistakes for individuals, revealing the need for anticipation.

Study tackles RLHF with diverse human feedback, showing limitations and proposing a meta-learning approach.

problem Traditional RLHF fails to balance diverse human preferences.
method Integrates meta-learning and multiple social welfare functions to optimize diverse preferences.
result Establishes sample complexity bounds for optimizing diverse social welfare functions.

Investors prioritize ESG in crypto-assets, showing higher exposure than traditional assets.

problem Understanding ESG preferences in crypto-assets and their investment behavior.
method A representative household finance survey in Austria to examine ESG preferences and crypto-investment exposure.
result ESG-conscious investors have higher exposure to crypto-assets compared to traditional asset classes.

Heterogeneous SVO leads to diverse policies in sequential social dilemmas.

problem Understanding how diverse social value orientations affect behavior in sequential social dilemmas.
method Extending prior reinforcement learning studies, we instantiated heterogeneous SVO in a sequential social dilemma setting and measured task-specific diversity metrics.
result Heterogeneous SVO leads to meaningfully diverse policies across various incentive structures.