Search arXivSearch

SEARCH · Search arXiv

Results for “econ.TH”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

106 records · Page 2Linked to original sources

When Can We Work in Embedding Space? What Text Embeddings Preserve

When do text embeddings work as inputs to empirical analysis? Their use rests on an assumption: that we can trade text for its low-dimensional embedding, and lose little in doing so. I make that assumption precise under a generative model in which documents are mixtures of latent topics. I study two uses---clustering units in embedding space and controlling for high-dimensional text. A cluster of embeddings is a set of documents with similar topic mixtures; controlling for the embedding is equivalent to controlling for the topic mixture, so validity reduces to whether that mixture captures the confounding. In an application to 363 U.S. metropolitan areas, embedding-based clusters of LLM-generated economic descriptions recover interpretable economic archetypes and separate local employment dynamics more sharply than clustering on model residuals, or on a curated set of industry and demographic covariates.

econ.EM

Blockchain-Enabled Secure Logging for Fiscal Electronic Mechanisms: Evaluation of the Greek eSEND and myDATA Tax Systems

This paper analyzes the implementation of blockchain-based integrity mechanisms in Greek Fiscal Electronic Mechanisms (FEMs) and the central tax information system eSEND. The study examines the cryptographic architecture of fiscal devices, including Electronic Cash Registers, Fiscal Printers, Fiscal Signing Machines, and FEMAS devices, which implement double or triple hash-chain structures to ensure transaction immutability. The transmission protocol between fiscal devices and the central database is also evaluated with respect to encryption, sequential validation, and blockchain verification. In contrast, the architecture of Electronic Invoicing Provider Services and the myDATA central platform is analyzed, highlighting the absence of blockchain-based integrity guarantees. The comparison demonstrates that hardware-based fiscal mechanisms provide stronger guarantees for transaction completeness and tamper resistance than purely software-based invoicing infrastructures. The findings highlight architectural weaknesses in the current e-invoicing framework and propose improvements for ensuring transaction integrity in digital tax ecosystems.

cs.CR

Foundation models for electricity price forecasting and battery arbitrage: Can they replace market-specific forecasting models?

Foundation models promise accurate forecasts with little or no task-specific training, but whether they can replace models designed specifically for electricity price forecasting remains unclear. We compare nine variants from five foundation model families, evaluated in zero-shot mode, with two state-of-the-art electricity price forecasting benchmarks in Germany, Poland, and Spain over 2021-2025. Their performance is assessed in terms of point and probabilistic forecasting accuracy, as well as economic value in battery energy storage arbitrage. Only the TabPFN models consistently and significantly outperform the benchmarks across all three markets and all statistical measures. However, this statistical dominance does not translate directly into economic dominance: TabPFN performs best under unlimited bids and riskier quantile-based strategies, whereas the Distributional Deep Neural Network benchmark is more profitable when risk tolerance is lower. Thus, foundation models cannot universally replace market-specific models, and their value depends on both model architecture and the decision problem.

cs.LG

Individualized Algorithmic Advice as a Strategic Signal on Competitive Markets

As algorithms increasingly mediate competitive decision-making, their influence extends beyond individual outcomes to shaping strategic market dynamics. In our experiment, we examined how algorithmic advice affects human behavior in a classic economic game with a unique, non-collusive, and analytically traceable equilibrium. Participants (N = 129) played a Cournot quantity competition with equilibrium-aligned or strategically biased algorithmic recommendations. While individualized equilibrium advice supported stable convergence, collusively downward-biased advice led to sustained underproduction and supracompetitive profits - hallmarks of tacit collusion. Participants' quantities converged faster and more consistently toward individualized than collective equilibrium advice, potentially due to an objective quality advantage or greater perceived ownership of the former. These findings demonstrate that algorithmic advice can function as a strategic signal, shaping coordination even without explicit communication. The results echo real-world concerns about algorithmic collusion and underscore the need for careful design and oversight of algorithmic decision-support systems in competitive environments.

cs.HC

Dutch Books for Language Models

People increasingly use language models to support life decisions. Many such decisions involve a probabilistic forecast: How likely is a major life event, a natural disaster, or an economic outcome? Users of language models may implicitly trust that these forecasts fall out of a coherent world model. In this paper, we evaluate the coherence of language model probabilistic forecasts through a procedure that builds on a theorem due to de Finetti. We elicit forecasts from language models across events generated from stock returns data. We then use linear programs to compute the largest Dutch-book profit - the profit an arbitrageur could guarantee by betting against model-generated probabilities - which we use as a measure of incoherence. Our procedure does not require outcome labels, so we can evaluate coherence even in settings where outcomes are not observed or have not yet resolved. We find substantial evidence of incoherence in language model forecasts. Such incoherence increases when there are richer logical relationships between events, and irrelevant contextual details can increase incoherence by an order of magnitude. We conclude by discussing how alternative training strategies may improve probabilistic coherence.

econ.GN

Optimal Uniform Pricing for Multi-Interval Dispatch without Make-Whole Uplifts

In a network with ramp-limited generators and inaccurate net-demand forecasts, practical rolling-window dispatch can drive locational marginal prices (LMPs) below generators' bid-in offers. In such cases, out-of-market (OOM) settlements are used to compensate generators and maintain dispatch-following incentives, but OOM can have negative consequences, including nontransparent real-time price signals, discriminatory compensation, and incentives for untruthful bidding. This paper presents an optimal uniform pricing rule that minimizes demand payments, eliminates OOM make-whole payments, preserves LMP-based congestion charges, and ensures revenue adequacy. We derive the proposed pricing rule in closed form and relate it to existing pricing schemes. Numerical comparisons demonstrate favorable generator profits and reduced price volatility. However, higher generator profits are accompanied by increased demand payments, reflecting the in-market, uniform allocation of ramping costs while preserving the LMP-based congestion charges widely used in real-time market settlements. The numerical results also show that, under LMP with OOM settlement, a price-taking generator has an incentive to inflate its offer, whereas this incentive is absent under the proposed pricing rule within the tested bid range.

eess.SY

Competitive Market Behavior of LLMs

Large language models (LLMs) are increasingly deployed as economic agents, yet there is little evidence whether LLM agents are suited for participating in market mechanisms designed for humans, and whether these mechanisms deliver desired outcomes when faced with LLM agents. We address this question by replicating seminal economic experiments, replacing human subjects with LLM agents. We place agents in a double auction environment, which is a widely-used market mechanism. We check whether such a market is able to deliver an efficient allocation of resources, thereby testing a novel dimension of alignment of LLM agents -- their compatibility with a fundamental market mechanism. We find that markets populated by LLM agents exhibit slower or no convergence towards market equilibrium, thus providing less efficient allocations than markets populated by humans. We then analyze agents' individual trading decisions and find substantial heterogeneity both across model families and market roles. We also run a lexical analysis of Chain-of-Thought (CoT) traces generated by the agents. We find that the decision to execute a trade rather than continue incrementally adjusting prices is associated with a shift from strategic considerations toward urgency. We publicly release our testing framework, which can be used for future evaluations.

cs.MA

Evaluating Impacts of Traffic Regulations in Complex Mobility Systems Using Scenario-Based Simulations

Urban traffic regulation policies are increasingly used to address congestion, emissions, and accessibility in cities, yet their impacts are difficult to assess due to the socio-technical complexity of urban mobility systems. Recent advances in data availability and computational power enable new forms of model-driven, simulation-based decision support for transportation policy design. This paper proposes a novel simulation paradigm for the ex-ante evaluation of direct and indirect impacts, spanning traffic conditions, transportation-related effects and economic accessibility. The approach integrates a multi-layer urban mobility model combining a physical layer of mobility flows and emissions with a social layer capturing behavioral responses and adaptation to policy changes. Real-world data are used to instantiate the current as-is scenario, while policy alternatives and behavioral assumptions are encoded as model parameters to generate multiple what-if scenarios. The framework supports systematic comparison across scenarios by analyzing variations in simulated outcomes induced by policy interventions. The proposed approach is illustrated through a case study that aims to assess the impacts of the introduction of broad urban traffic restriction schemes. Results demonstrate the framework's ability to explore alternative regulatory designs and user responses, supporting informed and anticipatory evaluation of urban traffic policies.

cs.CY

Budget-Constrained Causal Bandits: Bridging Uplift Modeling and Sequential Decision-Making

Treatment allocation under budget constraints is a central challenge in digital advertising. The standard approach trains an offline uplift model on historical data, then solves a constrained optimization to allocate budget. This fails in cold-start settings where little historical data exists. We propose Budget-Constrained Causal Bandits (BCCB), an online framework that learns which users respond to ads while simultaneously spending the budget. BCCB unifies three components: learning individual-level treatment effects, exploring users whose response is uncertain, and pacing the budget over time. We derive the per-arrival decision rule as the KKT condition of a Lagrangian relaxation of the budgeted causal-allocation objective, providing a principled foundation for the algorithm. We evaluate on the Criteo Uplift dataset using 20 random seeds with paired statistical tests. Our central finding is a data-efficiency crossover at n = 7,500 historical observations (paired one-sided t-test, p = 0.043): below this threshold, offline pipelines either fail or produce unreliable allocations, while BCCB operates from the first user. BCCB exhibits 2-4x lower run-to-run variance than offline methods and outperforms all four online baselines (Thompson Sampling, budgeted Thompson Sampling, HTE Greedy, and Uplifting Bandits) at every budget level tested (p < 0.001). These results give practitioners a concrete decision rule for choosing between offline and online paradigms.

cs.LG

Performance Manipulation: Labor Market Implications in AI-assisted Era

Performance manipulation arises when agents exploit easily measurable, routine tasks to inflate observable outcomes without contributing genuine innovation or expert judgment. We formalize this phenomenon in a game-theoretic model in which agents allocate effort along two margins. Creative effort is non-routine cognitive labor whose return is complementary to the agent's private expertise; it is the scarce input that principals seek. Mechanistic effort is the execution of well-defined, rule-based tasks that raise performance independently of expertise, a commoditized input that AI heavily augments. We establish the existence of a symmetric, monotone pure-strategy equilibrium and show that performance-based screening remains viable so long as evaluations retain a sufficient creative component, but collapses into an uninformative pooling equilibrium once AI capability grows large enough to crowd out creative effort. Comparing contest allocations against a single-agent baseline isolates performance manipulation as the competition-induced over-investment in mechanistic effort, which we show is undertaken systematically by low-type agents but not high-type ones. We further prove that more sharply skewed reward structures mitigate this friction by eliciting greater creative effort across the participant pool. Finally, using a novel, language-model-based methodology to measure both effort types from nearly 1,500 Kaggle competition scripts, we provide robust empirical support for the model's predictions.

econ.GN

Forecasting Weather-Driven Price Dynamics Across Sri Lankan Tea Market Catalogues

The Colombo Tea Auction (CTA) plays a vital role in determining global tea prices, yet the relationship between local weather conditions and price behavior across different tea catalogues has not been thoroughly explored. In this study, we develop a novel, structured dataset by extracting information from 105 weekly broker reports spanning late 2023 to 2026, and combined with region-specific weather data. Our analysis focuses on four main tea catalogues of Sri Lankan tea: High Grown, Low Grown, Off-Grade, and Dust. To better understand the factors influencing tea prices, we apply Granger causality analysis alongside tree-based machine learning models: Random Forest, XGBoost, LightGBM, and Gradient Boosting. Our results show that while market dynamics are primary drivers, weather conditions also have significant effects. Notably, Low Grown tea shows strong sensitivity to precipitation and sunshine duration (p<0.05) across 1-3-week lags. Off-Grade and Dust catalogues also exhibit significant responses to temperature variations. Catalogue-specific modelling outperformed unified approaches, with LightGBM emerging as the superior model for three out of four catalogues. Overall, this study highlights the importance of considering both localized weather patterns and catalogue-level differences when forecasting tea prices, offering a more precise and practical framework for the tea industry.

econ.GN

AI-Generated Measurements for Identification and Inference with Missing Data: A Weak Shadow Variable Approach

Across business and social science applications, outcomes are often missing in ways that depend on the unobserved outcomes themselves. In service systems, for example, whether a customer submits a rating depends on the rating they would have provided. Such missing-not-at-random (MNAR) mechanisms make population quantities difficult to identify without strong assumptions on the observation process. Meanwhile, rich unstructured data, such as customer interaction histories, are increasingly available and can be used to construct structured measurements using tools such as large language models (LLMs). In this work, we develop an assumption-lean partial identification framework that uses such measurements as weak shadow variables, defined as outcome-informative proxies that are conditionally independent of missingness given the true outcome and observed covariates. Importantly, they need not accurately predict missing outcomes or satisfy the completeness requirement in the classical shadow variable literature. For identification, we characterize sharp bounds on population quantities through a pair of linear programs. For estimation and inference, we propose a localized penalized estimator that remains feasible under sampling error, and a subsampling algorithm for constructing confidence intervals. In semi-synthetic experiments using real customer-service dialogues, weak-shadow-variable intervals are about 89\% narrower than those without auxiliary information, while their midpoints have around 41\% lower estimation error than classical MNAR methods.

stat.ML

Tastes without distinction: silicon samples and the synthetic construction of tastes

Large-language models have proven to be remarkable if inconsistent parrots of public attitudes and opinions. The extent to which LLMs are able to produce reasonable approximations of cultural taste remains an open empirical question that becomes more urgent by the day, with market research companies already offering provisional 'synthetic' survey panels and the contamination of standard survey data from LLM-generated responses. In this study, we build on past work on silicon sampling by extending considerations of their ecological, relational, and positional fidelity in the doomain of cultural tastes. We use large-language models from OpenAI, Anthropic, and DeepSeek to produce 554,940 silicon surrogates of survey respondents from the Survey of Public Participation in the Arts (SPPA). We find these silicon surrogates' tastes to be highly stylized facsimiles of human tastes. First, silicon samples are super-omnivorous with a systematic postive-bias for liking. These individual-level bias of silicon samples are not well-explained by the WEIRD-bias often discussed in the literature. Second, the complex relationality in real taste structures is completely distorted among silicon samples. Third, very little of the known cultural alignment between tastes and social space are preserved. Silicon samples juvenilize age-taste associations, resurrect anachronistic class-taste associations, and caricaturize gender- and race-taste associations. Key words: AI, taste, consumption, culture, silicon sampling, meta-analysis.

cs.CL

The Price of Intelligence: A Quality-Adjusted Price Index for AI Services

Posted prices for AI inference have fallen steadily since 2024, yet the measured speed of that fall depends almost entirely on the method of measurement. This paper constructs quality-adjusted price indices for the AI inference market from public data. The panel assembles 21,024 posted-price observations across 3,208 models and 86 providers and joins them to 4,605 benchmark scores through a latent quality index estimated from benchmark response patterns, so the quality ladder of the hedonic tradition is built here from evaluations in place of product characteristics. Measured by the matched-model methods that statistical agencies apply to software, inference prices fell at 0.10 log points a year. The quality-adjusted index fell at 0.73, so 87% of the decline is invisible to current methods, with direct consequences for measured competition, concentration and productivity in this market. Counted per completed task, moreover, the buyer's price stopped falling. Reasoning models raised token consumption faster than token prices fell, and the seller's and buyer's prices accordingly diverged. A pre-registered validity audit disciplines the quality measure and yields the sharpest result. Excluding contamination-flagged benchmarks leaves model rankings intact at 0.998 yet moves the index by 0.49 log points a year, so the leaderboard-stability arguments standard in AI evaluation offer no defence of economic statistics built on benchmarks. Prices, quality and the audit are fully reproducible from public sources at zero cost.

econ.GN

Measuring Computer Science Enthusiasm: A Questionnaire-Based Analysis of Age and Gender Effects on Students' Interest

This study examines how age and gender independently shape adolescents' interest in computer science (CS) education. Building on the Person-Object Theory of Interest (POI), we define enthusiasm as a short-term, activating response that combines positive affect, perceived relevance, and intention to re-engage. Because such enthusiasm can shift CS attitudes and engagement intentions even briefly, it offers a useful measure for short outreach activities. We developed a 28-item pre-post questionnaire to assess whether CS interventions raise enthusiasm, then applied it to more than 400 students (244 female, 187 male, aged 10-18) in CS courses. Contrary to the common assumption that early exposure secures lasting interest, we found a marked decline during early adolescence, especially among girls, along with wide variation in interest trajectories across ages. Exploratory factor analysis and ANOVA show that age predicts interest development more strongly than gender, and reveal specific developmental breakpoints. Although older students began with lower baseline attitudes, they showed the largest gains after the intervention, indicating that well-designed short activities can re-engage interest even later in adolescence. These results point to the need for CS education strategies that adapt to developmental stage rather than assuming a single early window matters most. Our validated questionnaire offers a way to measure immediate affective and motivational responses, giving researchers and practitioners a tool to evaluate whether specific interventions succeed in raising enthusiasm.

cs.SE

Digital Engagement, Income Disparities, and Job Seeking in the United States since 2010

Surveys often record how frequently people use the internet without measuring the infrastructures, skills, and support systems that make digital participation possible. Using the U.S. National Longitudinal Survey of Youth 1997 cohort, we study how internet-use frequency relates to labor income, employment attachment, and job seeking after 2010. The main digital-engagement analysis uses the comparable 2011, 2013, and 2015 waves, with 2017 retained as later labor-market context. Across repeated cross sections, daily internet use consistently marks higher income and stronger employment attachment. Relative to daily use, less-than-daily use is associated with roughly 11 to 20 percent lower income, while nonuse is associated with about 18 to 21 percent lower income in 2011 and 2013. Respondents reporting no internet use are also 13 to 23 percentage points less likely to report full-year work. Job-search estimates reveal a distinct mechanism: active search is governed by employment status, search intensity, and application support, so a frequency item sorts respondents more sharply on durable labor-market attachment than on short-window search. Education accounts for a substantial share of the raw digital gradient, and pooled lagged-outcome and doubly robust transition estimates separate durable stratification from positive adoption margins. The results establish internet-use frequency as an informative behavioral marker of digitally mediated labor-market stratification and clarify why routine use should not be treated as a simple measure of digital access.

cs.CY

When the Scaffold Stays On: AI, Practice Style, and Screening in Elite Skill Formation

Generative AI raises short-term productivity by completing tasks learners would otherwise practice on their own. Whether this exchange erodes frontier skill depends on the mode of use: substitute-users let AI stand in for practice and fail to develop skills, while complement-users use AI to learn faster. The modes look alike in AI-aided output, so organizations screening on that output cannot tell them apart. We ask whether the AI-prohibited evaluation gates organizations already operate can separate the modes. In elite competitive programming, ICPC and IOI contests prohibit AI under in-person proctoring, with qualification-round entry, whereas Codeforces (CF) practice and contests are unproctored and open to all. From CF practice histories we build an AI-prompt signature consistent with AI usage, more first-attempt acceptances, fewer attempts and debugging retries. CF practice has shifted toward this signature across entry cohorts spanning two AI rollouts. On CF, a stronger signature predicts smaller rating gains for users with no ICPC-IOI affiliation, but not for those who qualified. Inside the AI-prohibited ICPC environment, AI-era entrants show no skill erosion, and shifts toward AI-style practice predict higher non-AI-aided scores. One screening mechanism fits both: where the modes mix, a stronger signature flags substitute-users; among those who qualified, a strengthening signature marks adoption of the complement mode. The message is constructive: AI-style practice is compatible with frontier skill; the erosion risk links to the substitute mode; and separating the modes is a design question for the exams organizations regularly administer, from medical and legal boards to professional certification.

econ.EM

A simple derivation of the Kalman filter

In this lecture note, we present a concise and self-contained derivation of the discrete-time Kalman filter equations that requires only a basic understanding of least squares estimation. The treatment is designed to minimize mathematical overhead while preserving both rigor and generality.

math.OC