AI-driven Prices for Externalities and Sustainability in Production Markets
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
The Flow has not summarised this story yet — read it at arXiv AI.
arXiv:2610.21711v1 Announce Type: cross Abstract: Repeated Bertrand competition is a stringent benchmark for algorithmic pricing: in homogeneous-goods markets, standard learning procedures typically...
arXiv:2606. 31347v1 Announce Type: new Abstract: The electrification of transportation through electric vehicles introduces new challenges for power grid management, such as increased peak demand, voltage fluctuations, line overloads, and the integration of variable renewable energy sources.
The paper proposes a deep reinforcement learning framework for stock trading that incorporates sentiment analysis into actor‑critic agents. It compares pure policy‑optimization methods (A2C, PPO) with hybrid approaches that combine policy optimization and Q‑learning (DDPG, TD3, SAC). Results show that the hybrid agents consistently outperform others in profit maximization and risk‑averse trading when sentiment is deeply infused.
arXiv:2512. 22749v2 Announce Type: replace Abstract: We study the pricing behavior of third-party platforms facing strategic agents.
The paper examines whether autonomous learning-based agents in electricity markets can develop tacit collusion without explicit coordination. By modeling strategic bidding as a repeated game with imperfect public monitoring and employing multi-agent reinforcement learning, the authors identify conditions under which agents achieve supra-competitive outcomes. Their experiments demonstrate that such collusive behavior can emerge naturally, highlighting a realistic risk for algorithmic electricity markets.
FastCombo is a deep reinforcement learning method for iterative combinatorial auctions that learns price policies offline and applies them online with a single neural‑network forward pass. By formulating the problem as a partially observable Markov decision process, it assigns credit to queries that enable future decisions, thereby reducing the expected number of auction rounds. Experiments show that FastCombo achieves competitive clearing while cutting online price‑selection time by roughly 300–900 times compared to a standard Bayesian baseline.