For the first time ever, we analyze a unique public procurement database, which includes information about a number of bidders for a contract, a final price, an identification of a winner and an identification of a contracting authority for each of more than 40,000 public procurements in the Czech Republic between 2006…
Network science reveals corruption risk in EU procurement markets.
problem Identifying corruption risk in EU procurement markets.
method Analyzing a large dataset of public procurement contracts using network science.
result Corruption risk is clustered and varies by country, not just by market core or periphery.
Study finds public procurement awards, especially NGEU-funded ones, boost new lending.
problem Understanding the impact of public procurement on new lending.
method Panel data local projections model, controlling for various factors.
result Public procurement awards, particularly NGEU-funded ones, significantly increase new lending.
Study develops a smart contract framework for efficient and fair resource allocation.
problem Lack of rigorous economic foundation in decentralized coordination and smart contract implementations.
method Mechanism design framework with provable convergence guarantees for decentralized price adjustment.
result Proves stability and robustness of the proposed mechanism under various perturbations.
Ethereum trends analyzed through blockchain transactions and Google searches.
problem Identifying market manipulation in crypto prices.
method Big data analysis of Ethereum transactions, smart contracts, and search volumes.
result Big players manipulate crypto markets after price drops.
Benchmarking recursive collapse claims with a new framework under false-positive control.
problem Evaluating recursive systems for failure patterns and warning claims.
method Developed Loopzero framework for testing recursive failures, specified claim boundaries in Lean, evaluated under FP constraint, and compared with standard detectors.
result No standard detectors or Loopzero's pre-registered quantile detector achieved the required operating point under the false-positive contract.
Transformers can be made to implement specific algorithms by controlling training parameters.
problem Understanding when and how weight-tied looped transformers implement specific algorithms.
method Controlled experiments on group word problems, analyzing training contracts and convergence times.
result The speed and halting rule of weight-tied looped transformers are determined by the training contract and the number of loops.
Paper evaluates deadline-ILS on insider trading contracts, finding it distinguishes signals from noise.
problem Deadlines in insider trading contracts and information leakage detection.
method Empirical evaluation using FFIC dataset, hazard-rate estimation, cross-market wallet analysis.
result Deadline-ILS distinguishes signal from proxy artefact, with a significant shift in magnitude.
Framework insures AI actions with reserve capital, preventing loss.
problem Ensuring safety and accountability for AI actions with varying side effects.
method Developed Actuarial Action Interface (AAI) and Authority Frontier to price and gate AI actions.
result Found common refusal and release patterns across domains, with varying required reserve capital.
The paper explores coalescent contractions in contractible spaces, providing criteria and examples.
problem Existence and absence of coalescent contractions in contractible spaces.
method Analysis of contractible finite simplicial complexes and criteria for coalescent contractions.
result Criteria for contractible finite simplicial complexes that ensure no coalescent contractions.
Model shows incentives in shared order book can lead to free-rider problem.
problem Incentives in shared order books can lead to free-rider problem.
method Developed a Principal-Agent model with CARA utility functions.
result Equilibrium analysis shows incentives can lead to reduced competition.
The paper explores learning with a mix of private and public data while maintaining privacy.
problem Learning with a mix of private and public data while ensuring differential privacy.
method Designing a learning algorithm that satisfies differential privacy only with respect to private examples.
result A hypothesis class of VC-dimension d can be agnostically learned up to an excess error of α using only (roughly) d/α public examples and d/α^2 private labeled examples.
Computable contracts simplify financial transactions and reduce legal costs.
problem Difficulty in querying, executing, and analyzing text-based financial contracts.
method Develop a Contract Definition Language and illustrate use cases.
result Substantial improvements in customer experience and cost reduction.
Study public-data assisted private stochastic optimization with labeled or unlabeled public data.
problem Limits and capability of public-data assisted differentially private (PA-DP) algorithms in stochastic convex optimization.
method Lower bounds for PA-DP mean estimation and novel methods for leveraging public data in private supervised learning.
result Achieved dimension independent rate for GLM with unlabeled public data, showing optimality.
We prove optimal mechanisms for general contract spaces.
problem Optimal mechanism design under adverse selection and ambiguity.
method Existence proof for optimal mechanisms in general contract spaces.
result Centralized contracting is equivalent to delegated contracting.
In an online contract selection problem there is a seller which offers a set of contracts to sequentially arriving buyers whose types are drawn from an unknown distribution. If there exists a profitable contract for the buyer in the offered set, i.e., a contract with payoff higher than the payoff of not accepting any c…
Study improves keyword forecasting in earnings-call prediction markets.
problem Accurately predicting future keyword mentions in earnings calls.
method Experiments on earnings-call mention markets, varying context and market probability, introducing MCP.
result Mixture of market probability and MCP yields the best forecasts.
Public pretraining improves private model training even in extreme distribution shift scenarios.
problem Improving private model training accuracy in settings with large distribution shift.
method Empirical evaluation and theoretical explanation of public representations improving private training accuracy.
result Public representations can improve private training accuracy by up to 67% over private training from scratch in settings with large distribution shift.
Optimal execution strategy for merger & acquisition contracts with price impact.
problem Optimal execution and pricing of financial derivatives in M&A deals.
method Indifference utility arguments, considering linear and nonlinear contracts.
result Linear contracts are more expensive and vulnerable to manipulation.
Private estimation with public data reduces sample complexity.
problem Estimating private distributions with limited public data.
method Differentially private estimation with public data under constraints of pure or concentrated DP.
result Public data can significantly reduce private sample complexity for estimation.
Algorithm selects public datasets for private machine learning.
problem Choosing the most suitable public dataset for private machine learning.
method Measures gradient subspace distance between public and private datasets.
result Excess risk scales with the subspace distance between gradients.
This paper develops a method to select a reference contract for multi-contract quoting to minimize execution risk.
problem Minimizing execution risk in multi-contract quoting sequences.
method Develops a diagnostic framework using order-flow Hawkes forecasts and CLF to select a stable reference contract.
result Event-history and LOB-state signals offer complementary views for reference-contract selection.
Developed Merton's model for public companies using observed liabilities.
problem Estimating default risk for public companies.
method Campbell and Shiller's approximation method for risk-neutral values and default probabilities.
result Formulas and ML estimators for public companies' default probabilities.
Private distribution learning with public data, leveraging sample compression schemes.
problem Private distribution learning with public and private samples under differential privacy constraints.
method Connection to sample compression schemes and list learning.
result At least d public samples are necessary for private learnability of Gaussians in R^d.
Study uses AI to predict changes in international public finances based on US markets.
problem Understanding correlations between US and international public finances.
method Artificial intelligence and neural networks to model and predict changes.
result Neural network model achieved MSE of 2.79, indicating significant correlation and impact of US market volatility on international markets.
Proposes a probabilistic framework for smart contract risk quantification.
problem Quantifying financial risk of smart contract cyber attacks and failures.
method Probabilistic graph-theoretical framework using bond percolation models.
result Analytical results and numerical examples for aggregate loss distribution.
Complexes' contractibility depends on the Collatz conjecture.
problem Determining contractibility of complex structures.
method Construction of complex structures and analysis of their contractibility.
result Contractibility of complex structures is linked to the Collatz conjecture.
ELM detects mislabels in Finnish academic publication ranks.
problem Detecting mislabeled academic publication ranks in Finland.
method Used Extreme Learning Machine (ELM) with features characterizing publication channels.
result ELM-based approach accurately detected mislabels compared to reference results.
Improved security of smart contracts by classifying them into four categories.
problem Detecting and classifying vulnerabilities in smart contracts efficiently.
method Used AWD-LSTM for multi-class classification, addressing class imbalance.
result Achieved a weighted average Fbeta score of 90.0%.
Social networking sites such as Twitter have provided a great opportunity for organizations such as public libraries to disseminate information for public relations purposes. However, there is a need to analyze vast amounts of social media data. This study presents a computational approach to explore the content of twe…
Study on contracting maps and their rigidity under curvature constraints.
problem Rigidity of contracting maps between manifolds with positive curvature.
method Analysis of curvature pinching and contracting conditions involving singular values.
result Established the relation between curvature pinching and contracting conditions.
We study locally compact contractive local groups, that is, locally compact local groups with a contractive pseudo-automorphism. We prove that if such an object is locally connected, then it is locally isomorphic to a Lie group. We also prove a related structure theorem for locally compact contractive local groups whic…
Study shows some contractible complexes can't have certain immersions.
problem Understanding non-positive immersions in contractible complexes.
method Provided counterexamples to a conjecture by Wise.
result Some contractible complexes do not have non-positive immersions.
Polestar optimizes public transportation routes for efficiency and user satisfaction.
problem Difficulty in finding optimal public transportation routes due to complex networks and dynamic situations.
method Developed a Public Transportation Graph (PTG) and a route search algorithm with station binding and ranking modules.
result Demonstrated superior efficiency and user satisfaction compared to existing systems.
This paper presents some partial answers to the following question. QUESTION. If a normal space X is the union of an increasing sequence of open sets U(1), U(2), U(3) ... such that each U(n) contracts to a point in X, must X be contractible? The main results of the paper are: THEOREM 1. If a normal space X is the union…
The simplicial volume of non-R^3 contractible 3-manifolds is infinite.
problem Characterizing contractible 3-manifolds based on their simplicial volume.
method Analyzing the simplicial volume of contractible 3-manifolds and open 3-manifolds.
result The Euclidean space is the unique contractible 3-manifold with vanishing minimal volume.
SMOTE-DP enhances synthetic data privacy without sacrificing utility.
problem Balancing privacy and utility in synthetic data generation.
method Integrating SMOTE with differential privacy mechanisms.
result SMOTE-DP produces synthetic data that is both private and useful.
Study on reinsurance decisions using mean-variance criterion with irreversible contracts.
problem Optimizing reinsurance premiums and contracts in a Stackelberg game with irreversible contracts.
method Unified singular control framework applied to both discrete and continuous time reinsurance contracts.
result A single once-for-all reinsurance contract is preferred over multiple contracts, and the signing time is crucial.
Optimal contracts help principals delegate data collection in decentralized ML.
problem Dealing with information asymmetries in decentralized ML.
method Design of optimal and near-optimal contracts addressing uncertainty in model quality and performance.
result Simple linear contracts achieve 1-1/e fraction of optimal utility.
Study private query release with public data, reducing sample sizes.
problem Answering a wide range of statistical queries while maintaining privacy.
method Combines public and private samples to answer queries with differential privacy.
result Private and public sample complexities for different query classes.
Optimal contracts are found for agents with quadratic effort costs.
problem Finding optimal contracts in principal-agent problems with quadratic effort costs.
method Modeling the problem using Hamilton-Jacobi-Bellman (HJB) equations and proving the existence of classical solutions.
result Existence of optimal contracts for agents with quadratic effort costs is proven.
Fair insurance contracts are designed to handle default risk using cooperative game theory.
problem Designing fair insurance contracts in the presence of default risk.
method Cooperative game theory to specify premiums and participation in benefit.
result Fair benefit participation emerges as a game outcome involving residual risks.
This paper investigates Pareto optimal (PO, for short) insurance contracts in a behavioral finance framework, in which the insured evaluates contracts by the rank-dependent utility (RDU) theory and the insurer by the expected value premium principle. The incentive compatibility constraint is taken into account, so the …
One can define what it means for a compact manifold with corners to be a "contractible manifold with contractible faces." Two combinatorially equivalent, contractible manifolds with contractible faces are diffeomorphic if and only if their 4-dimensional faces are diffeomorphic. It follows that two simple convex polytop…
Optimal DP model training with public data improves privacy and accuracy.
problem Ensuring privacy while training models with public data.
method Proves optimal error rates for DP model training with public data, develops novel algorithms.
result Optimal error rates can be achieved by using public data or optimal DP algorithms.
New mortgage contracts reduce underwater default by adjusting loan balances, but must balance prepayment incentives.
problem Underwater default incentives in mortgages.
method Analyzes automatic balance adjustment and prepayment penalties in mortgage contracts.
result Automatic balance adjustments are preferable to traditional contracts at certain spreads, reducing underwater default.
New private learning algorithms improve utility in tasks with public features.
problem Private learning with public features in recommendation and ad prediction.
method Developed algorithms that protect only certain sufficient statistics, improving utility for linear regression and private recommendation benchmarks.
result Achieved state-of-the-art performance on private recommendation benchmarks.
We define a new notion of contracting element of a group and we show that contracting elements coincide with hyperbolic elements in relatively hyperbolic groups, pseudo-Anosovs in mapping class groups, rank one isometries in groups acting properly on proper CAT(0) spaces, elements acting hyperbolically on the Bass-Serr…