Cover Image

Optimal Trading of a Charging-Station Company in Auction Markets for Electricity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sohrabi, Farnaz, Rohaninejad, Mohammad, Hesamzadeh, Mohammad Reza, Bemš, Július
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Electrification of Transportation: A Hybrid Benders/SDDP Algorithm for Optimal Charging Station Trading
by: Sohrabi, Farnaz, et al.
Published: (2024)

Optimal Trading of a Charging-Station Company in Auction Markets for Electricity
by: Rohani Nezhad, Mohammad
Published: (2025)

Discrete Single-Parameter Optimal Auction Design
by: Giannakopoulos, Yiannis, et al.
Published: (2024)

Soft happy colourings and community structure of networks
by: Shekarriz, Mohammad H., et al.
Published: (2024)

Makespan Trade-offs for Visiting Triangle Edges
by: Georgiou, Konstantinos, et al.
Published: (2021)

Optimal Delivery with a Faulty Drone
by: Coleman, Jared, et al.
Published: (2024)

Density Decomposition in Dual-Modular Optimization: Markets, Fairness, and Contracts
by: Chan, T-H. Hubert, et al.
Published: (2025)

Computing Height-Optimal Tangles Faster
by: Firman, Oksana, et al.
Published: (2019)

Optimal Average Disk-Inspection via Fermat's Principle
by: Georgiou, Konstantinos
Published: (2025)

Trade-off between spread and width for tree decompositions
by: Bodlaender, Hans L., et al.
Published: (2026)

Optimal Representation for Right-to-Left Parallel Scalar Point Multiplication
by: Phalakarn, Kittiphon, et al.
Published: (2025)

Optimal placement of mobile distance-limited devices for line routing\
by: Erzin, Adil, et al.
Published: (2025)

On core of categorical product of (di)graphs
by: Naserasr, Reza, et al.
Published: (2025)

Symmetric Splendor: Unraveling Universally Closest Refinements and Fisher Market Equilibrium through Density-Friendly Decomposition
by: Chan, T-H. Hubert, et al.
Published: (2024)

A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
by: Kawamura, Akitoshi, et al.
Published: (2025)

Optimal energy collection with rotational movements constraints in concentrated solar power plants
by: Díaz-Bañez, J. M., et al.
Published: (2024)

Winding number and circular 4-coloring of signed graphs
by: Gujgiczer, Anna, et al.
Published: (2023)

Optimal sets of questions for Twenty Questions
by: Filmus, Yuval, et al.
Published: (2021)

Optimal Tree-Decompositions with Bags of Bounded Treewidth
by: Hendrey, Kevin, et al.
Published: (2025)

Optimal local identifying and local locating-dominating codes
by: Herva, Pyry, et al.
Published: (2023)

Spectral Independence and Local-to-Global Techniques for Optimal Mixing of Markov Chains
by: Chen, Zongchen, et al.
Published: (2023)

Balanced-chromatic number and Hadwiger-like conjectures
by: Jiménez, Andrea, et al.
Published: (2023)

Extended Deep Submodular Functions
by: Hosseini, Seyed Mohammad, et al.
Published: (2024)

Market proliferation and the impact of locational complexity on network restructuring
by: Pinar-Pérez, J. M., et al.
Published: (2024)

Multidimensional Electrical Networks and their Application to Exponential Speedups for Graph Problems
by: Li, Jianqiang, et al.
Published: (2023)

Extension of the Gyárfás-Sumner conjecture to signed graphs
by: Aubian, Guillaume, et al.
Published: (2025)

The Complexity of Cluster Vertex Splitting and Company
by: Firbas, Alexander, et al.
Published: (2023)

Stationary Online Contention Resolution Schemes
by: Aminian, Mohammad Reza, et al.
Published: (2026)

Partial Optimality in Cubic Correlation Clustering for General Graphs
by: Stein, David, et al.
Published: (2025)

Optimal Inapproximability of Promise Equations over Finite Groups
by: Butti, Silvia, et al.
Published: (2024)

Machine Learning Optimal Ordering in Global Routing Problems in Semiconductors
by: Choi, Heejin, et al.
Published: (2024)

Moving a Derivation Along a Derivation Preserves the Spine in Adhesive Categories
by: Kreowski, Hans-Jörg, et al.
Published: (2023)

Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
by: Bentert, Matthias, et al.
Published: (2023)

Playing Snake on a Graph
by: Graafsma, Denise, et al.
Published: (2025)

Multimodal Search on a Line
by: Coleman, Jared, et al.
Published: (2025)

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations
by: Bangachev, Kiril, et al.
Published: (2024)

Remote control system of a binary tree of switches -- II. balancing for a perfect binary tree
by: Golinelli, Olivier
Published: (2024)

Distribution of codewords on the faces of a hypercube and new combinatorial identities
by: Abdurakhmanov, Jamolidin K.
Published: (2025)

Fibonacci Index and Stability Number of Graphs: a Polyhedral Study
by: Bruyère, Véronique, et al.
Published: (2008)

Conditional Separation as a Binary Relation. A Coq Assisted Proof
by: Chancelier, Jean-Philippe, et al.
Published: (2021)