{'fraction_non_alphanumeric': 0.031209362808842653, 'fraction_numerical': 0.002600780234070221, 'mean_word_length': 5.581196581196581, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Nash equilibrium in strategic bidding: a binary expansion approach

This paper presents a mixed integer linear programming solution approach for the equilibrium problem with equilibrium constraints (EPEC) problem of finding the Nash equilibrium (NE) in strategic bidding in short-term electricity markets. A binary expansion (BE) scheme is used to transform the nonlinear, nonconvex, NE problem into a mixed integer linear problem (MILP), which can be solved by commercially available computational systems. The BE scheme can be applicable to Cournot, Bertrand, or joint price/quantity bidding models. The approach is illustrated in case studies with configurations derived from the 95-GW Brazilian system, including unit-commitment decisions to the price-maker agents.