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

36912 · Feb 202019922001200920172026
48 results for payment division

Market incentivizes parties to share high-quality data for collaborative machine learning tasks.

problem Fair revenue distribution and data replication threats in collaborative machine learning markets.
method Introduces a novel payment division function robust to replication and customized output models.
result Validated assumptions and showed approximate satisfaction for commonly used models.

Our work sheds new light on the role of oil prices in shaping the world economy by investigating flows of goods and services through global value chains between 1960 and 2011, by means of Markov Chain and network analysis. We show that over that time period the international division of labor and trade patterns are tig…

2015-02-28abs ↗pdf ↗

A new method streamlines digital payment programming using smart contracts.

problem High costs and security challenges in programming smart contracts for digital payments.
method Transforming digital currencies into token streams and using configurable templates to generate specialized smart contracts.
result Reduces payment programming costs and enhances security, self-enforcement, adaptability, and controllability.

Game theory applied to financial networks, focusing on debt repayment strategies.

problem Understanding financial stability in interconnected systems.
method Modeling financial systems as networks, analyzing utility-maximizing strategies under priority-proportional payments.
result Existence and uniqueness of payment profiles are not guaranteed, even under fixed strategies.

Research examines motivations and factors influencing retailers' payment method choices.

problem Understanding motivations and factors affecting retailers' payment method choices.
method Qualitative and quantitative analysis of various factors including regulatory constraints, merchant service providers, and demographic variables.
result Lower interchange fees and regulatory constraints make card payment adoption financially feasible for merchants.

Proves divisibility relations for symplectic curve polynomials.

problem Divisibility relations for symplectic curve polynomials.
method New proofs of divisibility relations for Oka and Alexander polynomials of symplectic curves.
result Proves Libgober's divisibility relations for symplectic curves.

The paper examines clearing payments in financial networks to prevent cascaded defaults.

problem Cascaded defaults in financial networks under the proportionality rule.
method Analysis of clearing model under pro-rated payments, derivation of necessary and sufficient conditions for clearing payments, convex optimization problems for computation.
result Clearing payments can be computed by solving convex optimization problems, reducing overall system loss by lifting the proportionality rule.

Paper introduces PHI to identify structurally distinct payment patterns in UK municipal procurement.

problem Vulnerability of public procurement to error, fraud, and corruption in high-volume transactions.
method Introduces Payment Heterogeneity Index (PHI) using Gaussian Mixture Model (GMM) and non-parametric statistics.
result Identifies a significant cohort with structurally distinct payment patterns, improving procurement oversight.

Paper tackles division difficulty, proposing new methods to improve accuracy.

problem Division is the most challenging arithmetic operation for both humans and computers.
method Proposes two novel approaches: Neural Reciprocal Unit (NRU) and Neural Multiplicative Reciprocal Unit (NMRU), and improves an existing division module.
result Improves division accuracy from 70.2% to 91.6%.

A new model calculates optimal clearing payments in dynamic financial networks.

problem Determining fair clearing payments in networks with potential defaults.
method Extends Eisenberg-Noe model to multiple time periods, solving linear programs for optimal payments.
result Proves the model satisfies the priority of debt claims requirement and finds unique optimal payments.

Payments data and machine learning improve nowcasting accuracy for macroeconomic indicators.

problem Lagged indicators in linear models are insufficient during crisis periods.
method Non-traditional payments data, nonlinear machine learning, and tailored cross-validation.
result Improved macroeconomic nowcasting accuracy up to 40% during crises.

In contrast to the many examples of convex divisible domains in real projective space, we prove that up to projective isomorphism there is only one convex divisible domain in the Grassmannian of pp-planes in R2p\mathbb{R}^{2p} when p>1p > 1. Moreover, this convex divisible domain is a model of the symmetric space associ…

2015-10-14abs ↗pdf ↗

Optimal student loan repayment strategies vary based on loan size.

problem Finding the most cost-effective repayment strategy for federal student loans.
method Analyzing the impact of different repayment strategies on total cost for varying loan sizes.
result Optimal repayment strategies depend on the loan balance, with different approaches for small, large, and intermediate balances.

Adopting a zonal structure of electricity market requires specification of zones' borders. In this paper we use social welfare as the measure to assess quality of various zonal divisions. The social welfare is calculated by Market Coupling algorithm. The analyzed divisions are found by the usage of extended Locational …

2014-05-05abs ↗pdf ↗

Agent-to-agent finance aims to manage payments and trust for AI agents.

problem Managing financial interactions between autonomous AI agents.
method Develops agent-to-agent finance concept and explores blockchain solutions.
result Agent-to-agent finance can address coordination frictions in financial markets.

We propose a model in which dividend payments occur at regular, deterministic intervals in an otherwise continuous model. This contrasts traditional models where either the payment of continuous dividends is controlled or the dynamics are given by discrete time processes. Moreover, between two dividend payments, the st…

2018-05-14abs ↗pdf ↗

Under certain integrability and geometric conditions, we prove division theorems for the exact sequences of holomorphic vector bundles and improve the results in the case of Koszul complex. By introducing a singular Hermitian structure on the trivial bundle, our results recover Skoda's division theorem for holomorphic …

2011-02-19abs ↗pdf ↗

The paper explains the topological origin of the distinction between incidence theorems over division rings and fields.

problem Understanding the distinction between incidence theorems over division rings and fields.
method Extending the surface-graph approach to noncommutative settings, the paper analyzes the topological properties of graphs embedded on surfaces of different genera.
result Theorems associated with graphs on the sphere hold over any division ring, while those on surfaces of positive genus typically hold only if the ground ring is a field.

The paper analyzes multivariate payments in multi-state life insurance using Markovian state processes.

problem Analyzing joint effects of life annuities and death benefits in a multi-state framework.
method Introduces multivariate present value of future payments, derives differential equations and moment generating functions, and focuses on pair-wise covariances.
result Derives Hattendorff type results for pair-wise covariances in a disability model.

The study reveals fundamental limits of fraud detection in card payment networks.

problem Fraud detection in card payment networks is challenging due to structural information impairments.
method Formalized card authorization as a sequential decision problem with delayed feedback, derived minimax regret lower bound.
result Improving issuer reporting quality or reducing censorship can yield larger reductions in the regret floor than increasing model complexity.

Researchers infer gene activity in dividing cells, accounting for protein inheritance and division history.

problem Inferring protein production kinetics in dividing cells due to protein inheritance and division history.
method Adapted conditional normalizing flows to approximate intractable likelihoods from simulated data.
result Glc3 gene is mostly inactive under stress, with brief and transient expression.

Geodesic connectedness proved for statistical manifolds with divisible cubic forms.

problem Geodesic connectedness of affine connections on statistical manifolds with divisible cubic forms.
method Analogy with Hopf-Rinow theorem in Riemannian geometry, establishing geodesic completeness.
result Geodesic connectedness established for statistical manifolds with divisible cubic forms.

We develop an axiomatic theory of balance functions (future value functions) in the theory of interest that is derived from financial considerations and which applies to general regulated payment streams, including continuous payment streams. Balance functions exist and are unique up to an initial choice of deposit and…

2012-08-05abs ↗pdf ↗

Study of characteristic numbers in 24-dimensional String manifolds.

problem Characterizing and understanding characteristic numbers of 24-dimensional String manifolds.
method Using Pontryagin numbers, integral basis of String cobordism group, and divisibility results.
result Established 2- and 3-primary divisibilities of characteristic numbers.

An open convex set in real projective space is called divisible if there exists a discrete group of projective automorphisms which acts co-compactly. There are many examples of such sets and a theorem of Benoist implies that many of these examples are strictly convex, have C1C^1 boundary, and have word hyperbolic divid…

2013-08-19abs ↗pdf ↗

Study on incentivizing truthfulness in federated learning with heterogeneous data.

problem Manipulated updates in federated learning due to data heterogeneity.
method Formulated a game-theoretic approach to prevent clients from misreporting their gradient updates.
result Developed a payment rule that provably disincentivizes sending modified updates in federated learning.