The study models productivity growth and cost shares in Japan and Korea.
problem Estimating productivity growth and cost shares in multifactor CES models.
method Regression of cost shares on factor prices using linked input-output tables.
result Economy-wide propagation of productivity stimuli evaluated in a multi-sectoral model.
Equilibrium found for multi-agent trading with transaction costs.
problem Designing a trading equilibrium for multiple agents with transaction costs.
method Proving the existence of a continuous-time Radner equilibrium with incentives and transaction costs.
result Each agent optimally trades for a specific time interval before stopping, influenced by transaction costs.
Study how transaction costs impact stock returns and holdings in equilibrium.
problem Impact of quadratic transaction costs on equilibrium stock returns and holdings.
method Developed a continuous-time risk-sharing model with FBSDEs to characterize equilibrium stock holdings and trading rates.
result Equilibrium stock holdings and trading rates are uniquely determined by FBSDEs, and equilibrium return by a system of coupled FBSDEs.
Study risk-sharing equilibria with general transaction costs, proving mean-reversion of returns.
problem Analyzing risk-sharing equilibria with general convex transaction costs.
method Infinite-horizon model with linear state dynamics, solved numerically using deep learning.
result Equilibrium returns mean-revert around frictionless counterparts, with different dynamics for quadratic and proportional costs.
Study asset pricing with transaction costs, showing unique equilibrium exists.
problem Risk-sharing economies with heterogeneous agents trading under quadratic transaction costs.
method Characterizes equilibrium asset prices and strategies via nonlinear, fully-coupled equations.
result Unique solution exists when agents' preferences are sufficiently similar, and empirical liquidity premia and discounts match transaction costs and volatility.
Model liquidity premia using a risk-sharing economy with quadratic costs.
problem Understanding the cross-section of liquidity premia earned by assets with different trading costs.
method Developed a risk-sharing economy model with quadratic transaction costs, leading to matrix-valued Riccati equations for equilibrium.
result Calibrated model to time series data, revealing liquidity premia across assets with varying trading costs.
Study how trading costs affect equilibrium returns in a model with heterogeneous investors.
problem How trading costs influence equilibrium returns in a model with mean-variance investors.
method Developed a continuous-time risk-sharing model with quadratic transaction costs, characterized equilibrium as solution of coupled forward-backward SDEs.
result Equilibrium returns are mean-reverting and higher for risk-averse net sellers or expanding asset supply.
FedFMC improves federated learning on non-iid data without sharing data or increasing communication costs.
problem Efficiently updating a global model on non-iid data in federated learning.
method FedFMC dynamically forks devices into different global models, merges and consolidates them.
result FedFMC substantially improves upon earlier approaches to non-iid data in federated learning.
Short sales allow tax deferral by offsetting gains from ordinary sales.
problem Tax deferral opportunity in short sales not regulated in the Philippine tax system.
method Short selling to offset gains from ordinary sales of identical stocks.
result Tax deferral opportunity exists but is unregulated in the Philippine tax system.
A mechanism to share risks and costs with guarantees against extreme outcomes.
problem Softening extreme individual burdens in risk sharing schemes.
method Formalizes Certified Allocation Problem; uses Conformal Risk Sharing with interpretable sharing policy and split conformal calibration.
result Reduces extreme obligations for high-risk agents while controlling harm to others.
Study optimal pairs trading with transaction costs using stochastic control.
problem Finding optimal trade times and shares in pairs trading with proportional costs.
method Singular stochastic control approach to solve a nonlinear quasi-variational inequality.
result Developed a discrete time dynamic programming algorithm to compute transaction regions.
New approach for sharing deep learning costs between devices and cloud.
problem Prohibitive deep learning computational requirements for embedded devices.
method Study of representation compressibility in MobileNetV2 for balancing computation, bandwidth, and accuracy.
result An optimal splitting layer for network can be found with a simple PCA-based compression scheme.
ComEx protocol reduces communication costs in cooperative bandits.
problem Minimizing communication costs in cooperative bandits while maintaining optimal performance.
method Developed ComEx protocol to reduce communication from Θ ( T ) Θ(T) Θ ( T ) to O ( log T ) O(\log T) O ( log T ) messages. result Achieves state-of-the-art performance with significantly reduced communication cost.
New analysis shows rational actors will deploy AGI despite negative social value due to catastrophic risk.
problem Rational actors will deploy AGI despite negative social value due to shared catastrophic risk.
method Continuous-time preemption game with shared catastrophic externalities, showing suicide region and welfare distortion.
result The suicide region widens as catastrophic risk grows, and two mechanisms can close it.
New algorithm balances exploration cost between groups in multi-armed bandits.
problem Balancing exploration cost between groups in multi-armed bandits.
method Introducing Col-UCB algorithm that dynamically coordinates exploration across groups.
result Achieves optimal minimax and instance-dependent collaborative regret up to logarithmic factors.
COM finds shared minima in multiple cost functions.
problem Optimizing multiple cost functions with different local minima.
method Exploring common minima shared by all cost functions without metaheuristics.
result High success rate in finding correct crystal structures.
This paper is the first attempt to formalize a new field of economics; studding the Intangibles Goods available on the Internet. We are taking advantage of the digital world's specific rules, in particular the zero marginal cost, to propose a theory of trading & sharing unified. A function based money is created as a w…
This study examines the execution phase of corporate share buy-backs, highlighting inefficiencies and costs.
problem Lack of research on share buy-back execution practices and associated costs.
method Comparative analysis of execution practices and fees charged to corporations and investors.
result Uncovered inefficiencies and frictional costs in share buy-back executions, advocating for transparency and fairness.
This paper examines allocation mechanisms in markets with transfer costs, showing how these costs affect economic efficiency.
problem Transfer costs in decentralized exchange markets reduce economic efficiency.
method An axiomatic study of allocation mechanisms in the presence of transfer costs, providing robust and conditional mean allocation mechanisms.
result Robust and conditional mean allocation mechanisms are identified, relating to risk sharing in agent pools.
Quaternion self-attention reduces computational cost and improves performance.
problem Existing quaternion self-attention increases computational cost and diverges attention distributions.
method Proposes a shared-score quaternion self-attention mechanism.
result Reduces score-computation multiplications by 75% and softmax operations from four to one.
Study compares market microstructure between two South African exchanges.
problem Understanding price response dynamics and market microstructure differences between two South African exchanges.
method Comparative analysis of returns distributions, auto-correlations, price impact, and trading costs on different time scales.
result Similar stylized facts emerge as measurement time scale increases, but price responses vary significantly.
Associating stock mechanics to real economy, in terms of volume, number of transactions, and cost, i.e. money flow for shares, we obtained the fundamental laws of stock mechanics.
The paper tackles fair sharing of exploration costs across groups in online learning.
problem Sharing the cost of exploration fairly across multiple groups in online learning.
method The paper introduces the 'grouped' bandit model and uses axiomatic bargaining theory, specifically the Nash bargaining solution, to formalize fairness.
result The paper derives policies that are optimally fair and regret-optimal, showing that regret-optimal policies can be unfair.
We develop a secure aggregation protocol for federated learning that reduces communication and computation costs.
problem Expensive communication and privacy concerns in federated learning.
method Adapting compression-based federated techniques to additive secret sharing.
result Our protocol achieves high accuracy with low communication costs and is more efficient than prior work.
A distributed algorithm reduces communication cost in linear bandits to near-optimal levels.
problem Cooperative linear bandit optimization with stochastic contexts.
method DisBE-LUCB algorithm, DecBE-LUCB algorithm, sharing information through a central server or immediate neighbors.
result Communication cost of DisBE-LUCB matches information-theoretic lower bound up to logarithmic factors.
RC reduces neural network redundancy and improves performance through independent BN layers.
problem Improving neural network performance and reducing redundancy.
method Recurrent convolution with independent batch normalization layers for different unrolling steps.
result The proposed method improves RC networks' performance and achieves cost-adjustable inference.
Efficient privacy-preserving machine learning framework using random transformations.
problem Slow training and inference speed in privacy-preserving machine learning systems.
method Random transformations like linear and permutation, combined with arithmetic sharing.
result High efficiency and low computation cost in private machine learning.
Study compares federated learning and coreset approaches for privacy in distributed machine learning.
problem Measuring privacy in distributed machine learning approaches.
method Comparison of federated learning and coreset approaches using membership inference attack.
result Federated learning offers better privacy than coreset, but with higher communication cost.
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} M and Model S \mathbb{S} S through convex optimization and game-theoretic lens. result Model S \mathbb{S} S achieves tighter security guarantees through single validator sets and aggregated slashing logic. MotherNets speed up deep ensemble learning with shared costs.
problem Training deep neural network ensembles is computationally expensive and time-consuming.
method MotherNets train a single or small set of MotherNets to share data movement and computation costs across ensembles, generating target ensembles by transferring function from MotherNets.
result MotherNets provide a new Pareto frontier for accuracy vs. training cost, scaling improvements as ensemble size increases.
Optimizes insurance processing capacity to minimize costs.
problem Processing delays and backlogs in insurance claims.
method Optimal capacity selection to minimize delay-adjusted and fixed costs.
result Minimizes claims costs by balancing processing capacity and delays.
Decentralized detection avoids sharing data, controls false discoveries.
problem Global false discovery rate control in decentralized novelty detection.
method Quantized surrogate models for low-precision sharing, preserving exchangeability.
result Quantized composite scores maintain competitive statistical power with reduced communication.
Study shows environmental spending positively impacts company profitability.
problem Impact of environmental spending on company profitability.
method Panel data regression analysis using E-Views.
result Environmental spending positively impacts profitability metrics.
Algorithm reduces regret in distributed kernel bandits with shared randomness.
problem Minimizing regret in collaborative function maximization.
method Uniform exploration at local agents and shared randomness with central server.
result Achieves optimal regret order with sublinear communication cost.
Variable renewables can avoid market value decline with policy changes.
problem Market value decline due to correlated generation from wind and solar.
method Theoretical analysis and simulation examples of market incentives and prices.
result Market value decline is due to policy assumptions, not inherent technology limitations.
In a market with one safe and one risky asset, an investor with a long horizon, constant investment opportunities, and constant relative risk aversion trades with small proportional transaction costs. We derive explicit formulas for the optimal investment policy, its implied welfare, liquidity premium, and trading volu…
FastSecAgg improves federated learning security and efficiency.
problem Privacy leakage in federated learning due to model parameter sharing.
method Introduces FastSecAgg, a secure aggregation protocol with FFT-based multi-secret sharing (FastShare).
result Efficient in computation and communication, robust to client dropouts.
Developed policy gradient methods for stochastic control with exit time, outperforming traditional techniques in share repurchase pricing.
problem Optimal control with exit time in stochastic models.
method Two types of algorithms: direct policy learning and alternately learning value function and control.
result Policy gradient methods outperform PDE or neural networks in share repurchase pricing.
NPAS trains neural networks with a fixed parameter budget, improving performance and compactness.
problem Training neural networks requires memory, and existing methods struggle with arbitrary parameter budgets.
method NPAS learns to share parameters automatically, covering low and high budgets.
result NPAS and SSNs improve network performance and compactness across various tasks.
Improves domain classification across multiple locales with shared language.
problem Improves domain classification accuracy in Spoken Language Understanding across multiple locales with shared language.
method Selective multi-task learning to create a joint representation of utterances over locales with different sets of domains.
result The proposed approach outperforms other baselines models especially when classifying locale-specific domains and low-resourced domains.
Paper proposes a network framework for prosumers to manage peak loads in Iran.
problem Balancing renewable prosumers' self-sufficiency with grid integration under uncertainty.
method Distributed contextual stochastic optimization (DCSO) framework with consensus-based sharing.
result Integration of prediction and optimization reduces peak loads and costs.
Network Lasso optimizes ride sharing predictions for real-time requests.
problem Real-time ride sharing prediction with adaptive and scalable techniques.
method Network Lasso optimization framework using ADMM optimization.
result Minimized mean squared error in prediction, demonstrating effectiveness.
A novel approach tackles sparse linear bandits with reduced communication costs and minimal cumulative regret.
problem Sparse linear bandits with high-dimensional feature vectors and limited relevant features.
method Cooperative Thresholded Lasso using Lasso and ridge regression for dimension reduction and aggregation.
result Regret bound of O ( s 0 log d + s 0 T ) \mathcal{O}(s_0 \log d + s_0 \sqrt{T}) O ( s 0 log d + s 0 T ) with high probability. Study predicts individual treatment effects in ride-sharing competitions.
problem Understanding how team competitions affect individual drivers' outcomes.
method Analyzed data from 500 competitions, built machine learning models.
result Reduced out-sample prediction error by over 24%.
AIBC uses AI and blockchain for efficient resource sharing.
problem Efficient resource sharing in large-scale decentralized systems.
method Two-consensus scheme with DABFT and DPoEV.
result Predictive deep learning for optimal BFT algorithm selection.
This paper examines three independent explanatory variables and their relation with cost overrun in order to decide whether this is different for Dutch infrastructure projects compared to worldwide findings. The three independent variables are project type (road, rail, and fixed link projects), project size (measured i…
Optimal tuning of Tikhonov regularizers achieves best performance without additional cost.
problem Selecting the best estimator among Tikhonov regularized estimators or their linear combinations.
method Convex aggregation procedure based on Q Q Q -aggregation. result Error term does not depend on penalty matrix or number of estimators.
Study examines hedging options on asset portfolios against one underlying asset with transaction costs.
problem Hedging options on asset portfolios when one underlying asset is expensive to trade.
method Simulated data analysis with varying trading intervals, correlation coefficients, and transaction costs.
result Trading the wrong asset can be beneficial when correlation is high and transaction costs are low.