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.

169,051 papers · 148 categories

Trend · papers per month

21426283 · Feb 202019922001200920182026
48 results for security games

Paper tackles multiplayer symmetric games, securing equal share for n players.

problem Multiplayer games lack unique equilibria, making guarantees unreliable.
method Identifies conditions for equal share, designs efficient algorithms inspired by no-regret learning.
result Proves algorithms achieve approximate equal share across various settings.

The paper analyzes security issues in blockchain ecosystems with multiple SSPs and proposes two models for better stake management.

problem Security issues in blockchain ecosystems with multiple SSPs and stake fragmentation.
method Formalized the Multiple SSP Problem and analyzed two architectures: Model M\mathbb{M} and Model S\mathbb{S} through convex optimization and game-theoretic lens.
result Model S\mathbb{S} achieves tighter security guarantees through single validator sets and aggregated slashing logic.

Paper tackles learning unknown game parameters from observations.

problem Learning unknown game parameters in games where parameters are not known to all agents.
method Proposes a differentiable, end-to-end learning framework for normal and extensive form games.
result Demonstrates effective learning of game parameters in poker and security game tasks.

This work develops secure distributed algorithms for machine learning to protect against data poisoning and network attacks.

problem Vulnerability of distributed machine learning algorithms to cyber threats.
method Game-theoretic framework to capture conflicting goals of a learner and an attacker, iterative distributed algorithm.
result Distributed SVM is prone to fail in different types of attacks, with impact depending on network structure and attack capabilities.

The large majority of risk-sharing transactions involve few agents, each of whom can heavily influence the structure and the prices of securities. This paper proposes a game where agents' strategic sets consist of all possible sharing securities and pricing kernels that are consistent with Arrow-Debreu sharing rules. F…

2014-12-13abs ↗pdf ↗

We start briefly surveying research on optimal stopping games since their introduction by E.B.Dynkin more than 40 years ago. Recent renewed interest to dynkin's games is due, in particular, to the study of Israeli (game) options introduced in 2000. We discuss the work on these options and related derivative securities …

2012-09-09abs ↗pdf ↗

Automatically finds effective security strategies through reinforcement learning and self-play.

problem Finding effective security strategies for intrusion prevention.
method Modeling interaction as a Markov game, evolving attack and defense strategies through reinforcement learning and self-play.
result Effective security strategies emerge from self-play, reflecting common-sense knowledge.

The paper studies an oligopolistic equilibrium model of financial agents who aim to share their random endowments. The risk-sharing securities and their prices are endogenously determined as the outcome of a strategic game played among all the participating agents. In the complete-market setting, each agent's set of st…

2012-06-02abs ↗pdf ↗

The paper introduces and studies hedging for game (Israeli) style extension of swing options considered as multiple exercise derivatives. Assuming that the underlying security can be traded without restrictions we derive a formula for valuation of multiple exercise options via classical hedging arguments. Introducing t…

2009-07-15abs ↗pdf ↗

Classification problems in security settings are usually contemplated as confrontations in which one or more adversaries try to fool a classifier to obtain a benefit. Most approaches to such adversarial classification problems have focused on game theoretical ideas with strong underlying common knowledge assumptions, w…

2018-02-21abs ↗pdf ↗

Game contingent claims (GCCs) generalize American contingent claims by allowing the writer to recall the option as long as it is not exercised, at the price of paying some penalty. In incomplete markets, an appealing approach is to analyze GCCs like their European and American counterparts by solving option holder's an…

2017-07-28abs ↗pdf ↗

This paper examines anomalies and frauds in blockchain networks and proposes detection techniques.

problem Anomalies and frauds undermine blockchain networks' integrity and security.
method Statistical and machine learning methods, game-theoretic solutions, digital forensics, reputation-based systems, and risk assessment techniques.
result Practical applications and insights for enhancing blockchain network security.

Survey of game theory methods to secure machine learning against adversarial attacks.

problem Adversarial attacks on machine learning algorithms in cybersecurity.
method Game theory framework to make algorithms robust against adversarial data.
result Survey of state-of-the-art techniques to secure machine learning.

We study the origins of the dt\sqrt{dt} effect in finance and SDE. In particular, we show, in the game-theoretic framework, that market volatility is a consequence of the absence of riskless opportunities for making money and that too high volatility is also incompatible with such opportunities. More precisely, riskles…

2018-02-04abs ↗pdf ↗

We derive formulas for the performance of capital assets in continuous time from an efficient market hypothesis, with no stochastic assumptions and no assumptions about the beliefs or preferences of investors. Our efficient market hypothesis says that a speculator with limited means cannot beat a particular index by a …

2018-02-05abs ↗pdf ↗

This paper optimizes cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.

problem Optimizing cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.
method Combining strategic behavior of players with contagion dynamics, a method is extended to determine optimal resource allocation based on simple network metrics weighted by risk profiles.
result The asymmetry between attacker and defender valuations drives optimal attack and defense strategies, shaping system resilience.

Study on price formation among investors with exponential utility and liabilities.

problem Equilibrium price formation among investors with heterogeneous risk-averseness and liabilities.
method Mean-field game theory and mean-field backward stochastic differential equations (BSDE).
result Existence of equilibrium risk-premium process and market clearing in the large population limit.

This paper establishes a non-stochastic analogue of the celebrated result by Dubins and Schwarz about reduction of continuous martingales to Brownian motion via time change. We consider an idealized financial security with continuous price path, without making any stochastic assumptions. It is shown that typical price …

2009-04-28abs ↗pdf ↗

This paper uses a mean-field game to model stablecoin market dynamics and recovery.

problem Understanding who restores the peg during de-pegging events of stablecoins.
method Dynamic, agent-based mean-field game framework for fiat-collateralized stablecoins.
result The equilibrium formulation endogenously maps market frictions into a price path and order flows, allowing for stress testing and attribution of peg-reverting pressure.

Optimizes a portfolio for an investor preferring accepted securities over a reference security.

problem Investor preference for a set of securities over a reference security with constraints.
method Mean-variance optimization with Sharpe Ratio performance measurement.
result Derives an optimal portfolio that maximizes returns while minimizing risk.

This paper explores security threats in ML systems and proposes mitigation techniques.

problem Security vulnerabilities in ML-based systems during training and inference.
method Overview of security threats, demonstrations using LeNet and VGGNet, proposed attack.
result Demonstrated security threats and proposed mitigation techniques.

We say that a pair of points x and y is secure if there exist a finite set of blocking points such that any geodesic between x and y passes through one of the blocking points. The main point of this paper is to exhibit new examples of blocking phenomena both in the manifold and the billiard table setting. As an approac…

2007-07-03abs ↗pdf ↗

Paper proposes a recursive PLS model for optimal response to security threats.

problem Optimal response to security threats after violations have occurred.
method Recursive Partial Least Squares (PLS) model with factorial analysis of security events.
result The model optimally estimates security administrators' responses to threats.

Libra ensures fair order-matching in electronic financial exchanges.

problem Technical shortcomings and infrastructure complexities in electronic trading.
method Formally defined temporal fairness, evaluated existing fair market designs, introduced Libra.
result Libra is more robust and resilient to technical manipulation than existing designs.

Sparse oblique decision tree improves security rules for renewable power systems.

problem Identifying secure operating conditions in power systems with high renewable energy.
method Sparse weighted oblique decision tree to learn and embed linear security rules.
result The method significantly increases secure states and reduces solution time.

A riemannian manifold is secure if the geodesics between any pair of points in the manifold can be blocked by a finite number of point obstacles. Compact, flat manifolds are secure. A standing conjecture says that these are the only secure, compact riemannian manifolds. The conjecture claims, in particular, that a riem…

2008-06-22abs ↗pdf ↗

Securely trains regression models with secret sharing for data collaboration.

problem Balancing data collaboration for technological improvements with security concerns.
method Secret sharing scheme for scalable and efficient secure multiparty training.
result Scalable and efficient protocols for training linear and logistic regression models.

This paper reviews ML and DL for IoT security, highlighting gaps and future directions.

problem Security and privacy issues in IoT networks due to resource constraints and dynamic behavior.
method Systematic review of current security solutions and ML/ DL approaches.
result ML and DL are essential for IoT security due to resource constraints and dynamic behavior.