pith. sign in

arxiv: 1907.08828 · v1 · pith:JXVELQNVnew · submitted 2019-07-20 · 💻 cs.GT

Bidding for Preferred Timing: An Auction Design for Electric Vehicle Charging Station Scheduling

Pith reviewed 2026-05-24 18:40 UTC · model grok-4.3

classification 💻 cs.GT
keywords electric vehicle chargingiterative auctionschedulingsocial welfare maximizationprivacy preservationgame theoryindividual rationalitypreference elicitation
0
0 comments X

The pith

An iterative auction computes high-quality EV charging schedules by progressively eliciting user time preferences while preserving privacy and proving individual rationality.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper addresses the problem of scheduling electric vehicle charging slots where each user has private preferences over start times and charging durations, with the objective of maximizing the sum of all users' values subject to station capacity. It introduces an iterative auction that asks users for preference information only as needed to build a schedule, rather than requiring complete value functions at the outset. A game-theoretic analysis establishes that the mechanism is individually rational, so no user loses by participating, and that reporting true preferences is a best response. Experiments demonstrate that the resulting schedules reach high social welfare even when only a fraction of each user's preferences is revealed, and they quantify how efficiency changes with the amount of information elicited.

Core claim

In an electric vehicle charging station where users may strategically reserve time slots according to their preferences over start times and charging lengths, the iterative auction elicits those preferences only as required to form a socially welfare-maximizing schedule. The mechanism is shown to be individually rational and to make truthful reporting a best response for each agent. Simulations confirm that near-optimal welfare is attained with partial value information, and the dependence of efficiency on the volume of revealed preferences is characterized.

What carries the argument

Iterative auction that progressively elicits preferences over charging start times and durations only as necessary to compute welfare-maximizing schedules.

If this is right

  • High-efficiency schedules are obtained without requiring users to disclose full preference information.
  • Participation is individually rational: no user receives negative utility from joining the auction.
  • Truthful reporting of preferences is a best response for each strategic user.
  • Scheduling efficiency improves as more preference information is revealed during the iterative process.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The observed relationship between information volume and efficiency implies that designers can tune the number of elicitation rounds to balance privacy against welfare loss.
  • Because the mechanism works with partial information, it could be combined with statistical models of typical user preferences to further reduce the number of queries needed in practice.

Load-bearing premise

Users are self-interested agents who may behave strategically to advance their own benefits rather than the social welfare of all agents.

What would settle it

An experiment in which agents submit non-truthful bids, the auction still terminates, and the achieved social welfare is materially lower than the levels reported under truthful best-response play would falsify the efficiency and incentive claims.

Figures

Figures reproduced from arXiv: 1907.08828 by Chun Wang, Jun Yan, Luyang Hou.

Figure 1
Figure 1. Figure 1: Efficiency and information revelation between the iterative biddi [PITH_FULL_IMAGE:figures/full_fig_p009_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: (a) Accommodation level, (b) rounds and (c) running time o [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
read the original abstract

This paper considers an electric vehicle charging scheduling setting where vehicle users can reserve charging time in advance at a charging station. In this setting, users are allowed to explicitly express their preferences over different start times and the length of charging periods for charging their vehicles. The goal is to compute optimal charging schedules which maximize the social welfare of all users given their time preferences and the state of charge of their vehicles. Assuming that users are self-interested agents who may behave strategically to advance their own benefits rather than the social welfare of all agents, we propose an iterative auction which computes high quality schedules and, at the same time, preserve users' privacy by progressively eliciting their preferences as necessary. We conduct a game theoretical analysis on the proposed iterative auction to prove its individual rationality and the best response for agents. Through extensive experiments, we demonstrate that the iterative auction can achieve high-efficiency solutions with a partial value information. Additionally, we explore the relationship between scheduling efficiency and information revelation in the auction.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 0 minor

Summary. The paper proposes an iterative auction for scheduling EV charging slots at a station, where users bid on preferred start times and durations to maximize social welfare. The mechanism progressively elicits preferences to preserve privacy, includes a game-theoretic analysis proving individual rationality and best-response strategies for agents, and reports experimental results showing high-efficiency schedules achievable with only partial value information.

Significance. If the incentive and efficiency properties hold under strategic behavior, the work provides a practical, privacy-aware mechanism for a growing application domain. The explicit focus on partial information and iterative elicitation is a positive feature, though the analysis does not establish dominant-strategy incentive compatibility.

major comments (2)
  1. [Game theoretical analysis] Game-theoretical analysis (as described in the abstract): the proofs establish individual rationality and best responses but do not claim or demonstrate dominant-strategy incentive compatibility. This is load-bearing for the central efficiency claim, because non-myopic agents can shade or withhold bids across rounds to manipulate future allocations, potentially degrading social welfare below the levels reported in the experiments.
  2. [Experiments] Experiments section: the reported high-efficiency outcomes with partial value information are presented without explicit discussion of the bidding model used (myopic/truthful vs. fully strategic). If the simulations assume myopic play, they do not directly support the efficiency claim under the strategic-agent premise stated in the abstract.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive feedback. We address the two major comments below, acknowledging where the manuscript requires clarification or additional discussion while defending the scope of our claims based on the analysis and experiments presented.

read point-by-point responses
  1. Referee: [Game theoretical analysis] Game-theoretical analysis (as described in the abstract): the proofs establish individual rationality and best responses but do not claim or demonstrate dominant-strategy incentive compatibility. This is load-bearing for the central efficiency claim, because non-myopic agents can shade or withhold bids across rounds to manipulate future allocations, potentially degrading social welfare below the levels reported in the experiments.

    Authors: We agree that the analysis establishes individual rationality and identifies best-response strategies (truthful reporting of queried preferences in each round) but does not prove dominant-strategy incentive compatibility. The efficiency results are supported under the best-response behavior characterized in the game-theoretic section. We will add explicit discussion in the revised manuscript clarifying that the mechanism is not DSIC and noting the potential for non-myopic manipulation as a limitation, while emphasizing that the iterative design and privacy preservation remain valid under the proven properties. revision: partial

  2. Referee: [Experiments] Experiments section: the reported high-efficiency outcomes with partial value information are presented without explicit discussion of the bidding model used (myopic/truthful vs. fully strategic). If the simulations assume myopic play, they do not directly support the efficiency claim under the strategic-agent premise stated in the abstract.

    Authors: The experiments model agents as following the best-response strategy from the game-theoretic analysis, which involves truthful revelation of preferences when elicited by the mechanism. We will revise the experiments section to explicitly describe this bidding model, reference the best-response result, and discuss how the reported efficiency holds under the analyzed strategic behavior rather than assuming purely myopic play. revision: yes

Circularity Check

0 steps flagged

No significant circularity in the derivation chain.

full rationale

The paper proposes an original iterative auction mechanism for EV charging scheduling, supported by a game-theoretic analysis proving individual rationality and best-response properties, plus experimental validation of efficiency under partial information. No equations, fitted parameters, or self-citations are shown to reduce any central claim (such as the auction's IR or efficiency) to a definitional tautology or prior self-referential result. The derivation chain is self-contained as an independent construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The design rests on standard mechanism-design assumptions rather than new invented entities or fitted parameters.

axioms (1)
  • domain assumption Users are self-interested strategic agents who may misreport preferences
    This premise is invoked to justify the need for incentive-compatible auction design and is stated explicitly in the abstract.

pith-pipeline@v0.9.0 · 5698 in / 1156 out tokens · 25720 ms · 2026-05-24T18:40:05.373669+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

45 extracted references · 45 canonical work pages

  1. [1]

    An empirical assessment of the feasibility of battery electric vehicles for day-to-day driving,

    S. Greaves, H. Backman, and A. B. Ellison, “An empirical assessment of the feasibility of battery electric vehicles for day-to-day driving,” Transp. Res. A, Policy Pract. , vol. 66, pp. 226–237, Aug. 2014

  2. [2]

    Defining the accuracy of real-world range estimations of an electric vehicle,

    S. A. Birrell, A. McGordon, and P. A. Jennings, “Defining the accuracy of real-world range estimations of an electric vehicle,” in Proc. IEEE 17th Int. Conf. Intell. Transp. Syst. (ITSC) , Oct. 2014, pp. 2590–2595

  3. [3]

    Charging scheduling with minimal waiting in a network of electric vehicles and charging stations,

    H. Qin and W. Zhang, “Charging scheduling with minimal waiting in a network of electric vehicles and charging stations,” in Proc. 8th ACM Int. Workshop Veh. Inter-Netw., 2011, pp. 51–60

  4. [4]

    Distributed scheduling and cooperative control for chargi ng of electric vehicles at highway service stations,

    A. Gusrialdi, Z. Qu, and M. A. Simaan, “Distributed scheduling and cooperative control for chargi ng of electric vehicles at highway service stations,” IEEE Trans. Intell. Transp. Syst. , vol. 18, no. 10, pp. 2713–2727, Oct. 2017

  5. [5]

    Smart charging schedules for highway travel with electric vehicles,

    V . D. Razo and H.-A. Jacobsen, “Smart charging schedules for highway travel with electric vehicles,” IEEE Trans. Transport. Electrific.,v o l .2 , no. 2, pp. 160–173, Jun. 2016

  6. [6]

    ABSCEV: An agent-based simulation framework about smart trans- portation for reducing waiting times in charging electric vehicles,

    I. García-Magariño, G. Palacios-Navarro, R. Lacuesta, and J. Lloret, “ABSCEV: An agent-based simulation framework about smart trans- portation for reducing waiting times in charging electric vehicles,” Comput. Netw., vol. 138, pp. 119–135, Jun. 2018. [ 7 ] F .A .V .P i n t o ,L .H .M .C o s t a ,D .S .M e n a s c h é ,a n dM .D .d eA m o r i m , “Space-aw...

  7. [7]

    Real-time optimal energy and reserve management of electric vehicle fast charging station: Hierarchical game approach,

    T. Zhao, Y . Li, X. Pan, P. Wang, and J. Zhang, “Real-time optimal energy and reserve management of electric vehicle fast charging station: Hierarchical game approach,” IEEE Trans. Smart Grid , vol. 9, no. 5, pp. 5357–5370, Sep. 2018

  8. [8]

    Financial viability of non-residential electric vehicle charging stations,

    D. Chang et al. , “Financial viability of non-residential electric vehicle charging stations,” Luskin Center Innov., Los Angeles, CA, USA, Tech. Rep., 2012. [Online]. Available: https://luskin.ucla.edu/sites/ default/files/Non-Residential%20Charging%20Stations.pdf

  9. [9]

    Design and planning of a multiple-charger multiple-port charging system for PEV charging station,

    H. Chen, Z. Hu, H. Luo, J. Qin, R. Rajagopal, and H. Zhang, “Design and planning of a multiple-charger multiple-port charging system for PEV charging station,” IEEE Trans. Smart Grid , vol. 10, no. 1, pp. 173–183, Jan. 2017

  10. [10]

    Dis tributed charge scheduling of plug- in electric vehicles using inter-aggregator collaboration,

    J. C. Mukherjee and A. Gupta, “Dis tributed charge scheduling of plug- in electric vehicles using inter-aggregator collaboration,” IEEE Trans. Smart Grid, vol. 8, no. 1, pp. 331–341, Jan. 2017

  11. [11]

    Intelligent parking garage EV charging scheduling considering battery charging characteristic,

    Z. Wei, Y . Li, Y . Zhang, and L. Cai, “Intelligent parking garage EV charging scheduling considering battery charging characteristic,” IEEE Trans. Ind. Electron., vol. 65, no. 3, pp. 2806–2816, Mar. 2018

  12. [12]

    Profit maximization with customer satisfaction control for electric vehicle charging in smart grids,

    E. Collado, E. L. Xu, H. Li, and S. Cui, “Profit maximization with customer satisfaction control for electric vehicle charging in smart grids,” Environments, vol. 21, p. 23, Jan. 2017

  13. [13]

    A market mechanism for electric vehicle charging under network constraints,

    J. de Hoog, T. Alpcan, M. Brazil, D. A. Thomas, and I. Mareels, “A market mechanism for electric vehicle charging under network constraints,” IEEE Trans. Smart Grid , vol. 7, no. 2, pp. 827–836, Mar. 2016. This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. 12 IEE...

  14. [14]

    A novel resource reservation scheme for mobile PHEVs in V2G environment using game theoretical approach,

    K. Kaur, A. Dua, A. Jindal, N. Ku mar, M. Singh, and A. Vinel, “A novel resource reservation scheme for mobile PHEVs in V2G environment using game theoretical approach,” IEEE Trans. Veh. Technol. , vol. 64, no. 12, pp. 5653–5666, Dec. 2015

  15. [15]

    Smart management of distinct plug-in hybrid electric vehicle char ging stations considering mobility pattern and site characteristics,

    S. Suganya, S. C. Raja, and P. Venkatesh, “Smart management of distinct plug-in hybrid electric vehicle char ging stations considering mobility pattern and site characteristics,” Int. J. Energy Res. , vol. 41, no. 14, pp. 2268–2281, 2017

  16. [16]

    D ynamic pricing, scheduling, and energy management for profit maximization in PHEV charging sta- tions,

    Y . Kim, J. Kwak, and S. Chong, “D ynamic pricing, scheduling, and energy management for profit maximization in PHEV charging sta- tions,” IEEE Trans. Veh. Technol. , vol. 66, no. 2, pp. 1011–1026, Feb. 2017

  17. [17]

    An integrated simulation framework to model electric vehicle operations and services,

    L. Bedogni et al., “An integrated simulation framework to model electric vehicle operations and services,” IEEE Trans. Veh. Technol. , vol. 65, no. 8, pp. 5900–5917, Aug. 2016

  18. [18]

    Design and evaluation of charging station scheduling strategies for electric vehicles,

    J. Timpner and L. Wolf, “Design and evaluation of charging station scheduling strategies for electric vehicles,” IEEE Trans. Intell. Transp. Syst., vol. 15, no. 2, pp. 579–588, Apr. 2014

  19. [19]

    Optimal dynamic allocation and space reservation for electric vehicles at charging stations,

    C. G. Cassandras and Y . Geng, “Optimal dynamic allocation and space reservation for electric vehicles at charging stations,” IFAC Proc. Vol., vol. 47, no. 3, pp. 4056–4061, 2014

  20. [20]

    Optimal day-ahead charging scheduling of electric vehicles through an aggregative game model,

    Z. Liu, Q. Wu, S. Huang, L. Wang, M. Shahidehpour, and Y . Xue, “Optimal day-ahead charging scheduling of electric vehicles through an aggregative game model,” IEEE Trans. Smart Grid , vol. 9, no. 5, pp. 5173–5184, Sep. 2018

  21. [21]

    Stackelberg-game- based demand response for at-home electric vehicle charging,

    S.-G. Yoon, Y .-J. Choi, J.-K. Park, and S. Bahk, “Stackelberg-game- based demand response for at-home electric vehicle charging,” IEEE Trans. Veh. Technol., vol. 65, no. 6, pp. 4172–4184, Jun. 2016

  22. [22]

    Economics of electric vehicle charging: A game theoretic approach,

    W. Tushar, W. Saad, H. V . Poor, and D. B. Smith, “Economics of electric vehicle charging: A game theoretic approach,” IEEE Trans. Smart Grid, vol. 3, no. 4, pp. 1767–1778, Dec. 2012

  23. [23]

    Incentive-based distributed scheduling of electric vehicle charging under uncertainty,

    Y . Zhou, R. Kumar, and S. Tang, “Incentive-based distributed scheduling of electric vehicle charging under uncertainty,” IEEE Trans. Power Syst., vol. 34, no. 1, pp. 3–11, 2019

  24. [24]

    O n l i n e scheduling and pricing for electric vehicle charging,

    M. M. Nejad, L. Mashayekhy, R .B .C h i n n a m ,a n dD .G r o s u ,“ O n l i n e scheduling and pricing for electric vehicle charging,” IISE Trans. , vol. 49, no. 2, pp. 178–193, 2017

  25. [25]

    Online mechanism design for electric vehicle charging,

    E. H. Gerding, V . Robu, S. Stein, D. C. Parkes, A. Rogers, and N. R. Jennings, “Online mechanism design for electric vehicle charging,” in Proc. 10th Int. Conf. Auto. Agents Multiagent Syst., Int. Found. Auton. Agents Multiagent Syst. , vol. 2, 2011, pp. 811–818

  26. [26]

    Combinatorial auction-based pricing for multi-tenant autonomous vehicle public transportation system,

    A. Y . S. Lam, “Combinatorial auction-based pricing for multi-tenant autonomous vehicle public transportation system,” IEEE Trans. Intell. Transp. Syst., vol. 17, no. 3, pp. 859–869, Mar. 2016

  27. [27]

    A two-layer model for dynamic pricing of electricity and optimal charging of electric vehicles under price spikes,

    V . Subramanian and T. K. Das, “A two-layer model for dynamic pricing of electricity and optimal charging of electric vehicles under price spikes,” Energy, vol. 167, pp. 1266–1277, Jan. 2019

  28. [28]

    Optimal scheduling of plug-in electric vehicles and renewable micro-grid in energy and reserve ma rkets considering demand response program,

    P. Aliasghari, B. Mohammadi-Ivatloo, M. Alipour, M. Abapour, and K. Zare, “Optimal scheduling of plug-in electric vehicles and renewable micro-grid in energy and reserve ma rkets considering demand response program,” J. Cleaner Prod. , vol. 186, pp. 293–303, Jun. 2018

  29. [29]

    Real-time smart charging of electric vehicles for demand charge reduction at non-residential sites,

    G. Zhang, S. T. Tan, and G. G. Wang, “Real-time smart charging of electric vehicles for demand charge reduction at non-residential sites,” IEEE Trans. Smart Grid , vol. 9, no. 5, pp. 4027–4037, Sep. 2018

  30. [30]

    Two-stage energy manage- ment for office buildings with workplace ev charging and renewable energy,

    D. Wu, H. Zeng, C. Lu, and B. Boulet, “Two-stage energy manage- ment for office buildings with workplace ev charging and renewable energy,” IEEE Trans. Transport. Electrific. , vol. 3, no. 1, pp. 225–237, Mar. 2017

  31. [31]

    Two-stage mechanism for massive electric vehicle charging involving renewable energy,

    R. Wang, P. Wang, and G. Xiao, “Two-stage mechanism for massive electric vehicle charging involving renewable energy,” IEEE Trans. Veh. Technol., vol. 65, no. 6, pp. 4159–4171, Jun. 2016

  32. [32]

    Stochastic scheduling of aggregators of plug-in electric vehicles for participation in energy and ancillary service markets,

    M. Alipour, B. Mohammadi-Ivatl oo, M. Moradi-Dalvand, and K. Zare, “Stochastic scheduling of aggregators of plug-in electric vehicles for participation in energy and ancillary service markets,” Energy, vol. 118, pp. 1168–1179, Jan. 2017

  33. [33]

    A two-stage stochastic model for energy storage planning in a microgrid incorporating bilateral contracts and demand response program,

    A. Nazari and R. Keypour, “A two-stage stochastic model for energy storage planning in a microgrid incorporating bilateral contracts and demand response program,” J. Energy Storage , vol. 21, pp. 281–294, Feb. 2019

  34. [34]

    A daytime optimal stochastic energy management for EV commercial parking lots by using approximate dynamic programming and hybrid big bang big crunch algorithm,

    M. Sedighizadeh, A. Mohammadpour , and S. M. M. Alavi, “A daytime optimal stochastic energy management for EV commercial parking lots by using approximate dynamic programming and hybrid big bang big crunch algorithm,” Sustain. Cities Soc. , vol. 45, pp. 486–498, Feb. 2019

  35. [35]

    A review of charge scheduling of electric vehicles in smart grid,

    J. C. Mukherjee and A. Gupta, “A review of charge scheduling of electric vehicles in smart grid,” IEEE Syst. J. , vol. 9, no. 4, pp. 1541–1553, Dec. 2015

  36. [36]

    Computational scheduling methods for integrating plug-in electric vehicles with power systems: A review,

    Z. Yang, K. Li, and A. Foley, “Computational scheduling methods for integrating plug-in electric vehicles with power systems: A review,” Renew. Sustain. Energy Rev., vol. 51, pp. 396–416, Nov. 2015

  37. [37]

    The charging-scheduling problem fo r electric vehicle networks,

    M. Zhu, X.-Y . Liu, L. Kong, R. Shen, W. Shu, and M.-Y . Wu, “The charging-scheduling problem fo r electric vehicle networks,” in Proc. IEEE Wireless Commun. Netw. Conf. (WCNC) , Apr. 2014, pp. 3178–3183

  38. [38]

    A game-theoretic approach to optimal scheduling of parking-lot electric vehicle charging,

    L. Zhang and Y . Li, “A game-theoretic approach to optimal scheduling of parking-lot electric vehicle charging,”IEEE Trans. Veh. Technol., vol. 65, no. 6, pp. 4068–4078, Jun. 2016

  39. [39]

    Game theoretic based charging strategy for plug-in hybrid electric vehicles,

    S. Bahrami and M. Parniani, “Game theoretic based charging strategy for plug-in hybrid electric vehicles,” IEEE Trans. Smart Grid ,v o l .5 , no. 5, pp. 2368–2375, Sep. 2014

  40. [40]

    Due-date man- agement through iterative bidding,

    C. Wang, Z. Wang, H. H. Ghenniwa, and W. Shen, “Due-date man- agement through iterative bidding,” IEEE Trans. Syst., Man, Cybern. A, Syst. Humans, vol. 41, no. 6, pp. 1182–1198, Nov. 2011

  41. [41]

    Counterspeculation, auctions, and competitive sealed ten- ders,

    W. Vickrey, “Counterspeculation, auctions, and competitive sealed ten- ders,” J. Finance, vol. 16, no. 1, pp. 8–37, 1961

  42. [42]

    Sol ving parallel machine scheduling problems by column generation,

    Z.-L. Chen and W. B. Powell, “Sol ving parallel machine scheduling problems by column generation,” INFORMS J. Comput., vol. 11, no. 1, pp. 78–94, 1999

  43. [43]

    Bi dding languages,

    N. Nisan, “Bi dding languages,” in Combinatorial Auctions. Cambridge, MA, USA: MIT Press, 2006, pp. 400–420

  44. [44]

    D. C. Parkes and L. H. Ungar, Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency . Philadelphia, PA, USA: Univ. of Pennsylvania, 2001

  45. [45]

    Workplace charging case study: Charging station utilization at a work site with AC level 1, AC level 2, and DC fast charging units,

    J. Smart and D. Scoffield, “Workplace charging case study: Charging station utilization at a work site with AC level 1, AC level 2, and DC fast charging units,” Idaho Nat. Lab., Idaho Falls, ID, USA, Tech. Rep. INL/EXT-14-32340, 2014. Luyang Hou (S’17) received the B.Eng. degree in mechanical design, manufacturing, and automation from Henan Polytechnic Uni...