An Equilibrium Analysis of a Secondary Mobile Data-Share Market

: Internet service providers are offering shared data plans where multiple users may buy and sell their overage data in a secondary market managed by the ISP. We propose a game-theoretic approach to a software-deﬁned network for modeling this wireless data exchange market: a fully connected, non-cooperative network. We identify and deﬁne the rules for the underlying progressive second price (PSP) auction for the respective network and market structure. We allow for a single degree of statistical freedom—the reserve price—and show that the secondary data exchange market allows for greater ﬂexibility in the acquisition decision making of mechanism design. We have designed a framework to optimize the strategy space using the elasticity of supply and demand. Wireless users are modeled as a distribution of buyers and sellers with normal incentives. Our derivation of a buyer-response strategy for wireless users based on second price market dynamics leads us to prove the existence of a balanced pricing scheme. We examine shifts in the market price function and prove that our network upholds the desired properties for optimization with respect to software-deﬁned networks and prove the existence of a Nash equilibrium in the overlying non-cooperative game.


Introduction
We study an evolving non-cooperative real-time market. The changing demand of consumers operating on a wireless network has led companies to change their strategy towards data management and networking among wireless users. Mobile phone data experiences dynamically changing demand. Companies are beginning to measure, customize prices, and serve customers according to their individual demand in real time.
Recently, AT&T has introduced a mobile data-sharing plan [1], which allows consumers to manage their own data usage in a real-time auction on a public platform managed by AT&T. In this work, we derive the Nash equilibrium by examining the resulting structure of this secondary data market. We address several topics: data as a product in the real-monetary market, and data as a network resource in a wireless topology.
As older softwares move from (wired) grid-based to node-based communication, a new paradigm of programmable network architectures is becoming the standard for wireless communication. These decentralized software-centric networks manage services modularly and allow for flexibility of demand; a decentralized design better suited to managing mobile networks, and mobility becomes a factor in network design. The relationship between the provider and the consumer is shifting; it is becoming a necessity to discretize consumer valuation. This is the new paradigm of digital economics.
There is a clear need for algorithms designed for optimization in this mobile space. Mobile devices provide flexibility, and may make individual decisions regarding local network infrastructure. In many cases, the direct communication between mobile devices allows for a simple mutation of classic optimization models. In online (web) resource allocation algorithms, auctions are used to implement the fair distribution of resources in reserve price, or market price, as in this work. Research has been done for PSP auctions, and improvements have been made to the original work from Lazar and Semret. In [4], user strategy gives a "quantized" version of PSP, improving the rate of convergence of the game by shifting the bid price based on some threshold. Modifications to the mechanism that result in improved convergence also appear in [5], which relies on a global approximation function of demand.
Approximation of demand is a popular avenue of research for the division of data in a PSP auction. The complexity and amount of data inherent in digital data sharing creates a natural necessity; platforms must take advantage of the continuity of auctions restricted to simple sellers and buyers, as well as grid-based platforms. An approximation of the global demand function that uses a statistical approximation of the state space is derived from the theory of potential games. Potential games make use of a global strategy defined by the potential function; many companies use this as a mathematical tool to gather user data in order to further shape their market space. The idea of potential games in PSP markets was used by Zhong to coordinate the fair charging of electric vehicles in [6]; the potential game modeled the distribution of the load variance in electric vehicle charging, minimizing it as a global function with some constraints. The benefit of potential games is that, under some conditions, we are guaranteed convergence to a Nash equilibrium.
The analysis and interpretation of the data exchanged between the data-serve platform and the user quantify user value individually and strive to understand the decision process with increasing granularity. Usually, companies only know their marginal costs and can only infer user value by sample estimation. Today, with pervasive data and increasingly precise analytical capabilities, companies can derive a more precise estimate of value per user, and still maintain a zero marginal cost. Recently, using a mobile app as a platform, [7] assigns electric vehicles to charging stations, replacing a first-come-first-serve system, and ensuring that there is enough power assigned to keep each user satisfied without overloading the supply. Importantly, [7] considers the individual valuations of the users. More generally, [8] defines an optimal strategy for buyers and brokers using a gametheoretic derivation, and further shows the existence of network-wide market equilibria obtained by the specific provisioning of this network given specific network dynamics. Indeed, various equilibria may be derived by designing the structure of provisioning in distributed systems, motivated by individual users interests. The continuity of data supplied by the customer demand allows for the continuity of change to the pricing system of the data-serve platform. By allowing a user preference to, loosely, represent a policy, we may interpret a user preference from the data exchange market as a plan to allow users to set their own policies, and rely on the existing framework to implement their preferences. Game-theoretical analysis of mobile data has been presented in [9] as a framework for mobile-data offloading.
This new type of provisioning is described as virtual elasticity in [10], a paper that has recently provided an innovative way to estimate future prices, an avenue of research that is of great interest to the marketing community. The estimation of future prices is difficult in PSP auctions, due to the dynamically changing bids. However, an estimation of future demand (price) can greatly affect the efficiency of the provisioning system, particularly with static resources, such as computer memory.
Finally, we mention that the concern of privacy is addressed in [11]. This paper addresses the problem of privacy between the web user and the advertiser, which is beyond the scope of this paper. However, we mention that the issue of privacy can change based on the platform, and the extent to which we have implemented data privacy, through anonymous bids, may not be sufficient. Our analysis is largely based on the work of [12] and his examination of second price auctions in networked settings. In particular, we make use of the assumption of consistent bids, in the special case where consistent bidding is an optimal solution, i.e., a Nash equilibrium.

The Market Mechanism
We aim to design a distributed PSP auction, operating within a strategic framework that determines the bidding behavior of users in a wireless network. The auction design must must meet a certain set of known criteria: (1) truthfulness , (2) individual rationality/ selfishness, (3) social welfare maximization, and (4) an anonymous winning bid. For the secondary data exchange market, we determine that the strategy space must meet additional criteria: (5) privacy and independence from the ISP, (6) locally fair division, and (7) minimize crossover in buyer/ seller pools. In second-price markets, the winning bid does not pay the winning bid price, but the price from next lowest bid. This provides the market with the property of truthfulness through incentive compatibility, meaning that a bidder will truthfully reveal its valuation of the resource. The exclusion-compensation principle, or Pareto criterion, is built into the pricing mechanism, and guarantees that at equilibrium, any change to the system would make at least one user worse-off.
Let the set of all wireless users be labeled by the index set I = {1, · · · , I}. In our current formulation, we do not allow a seller to host multiple auctions, and so we may assume that data is a unary resource belonging to the seller, and identify each local auction with the index of the seller j ∈ I. The bid profiles of the users are given as, s ≡ [s j i ] where (i, j) ∈ I × I. We assume that all inactive bids are zeroed, i.e., if there is no interaction between two players i and j, then (i, j) = 0. Then, I × I is a matrix, with each element of the matrix representing a single buyer-seller interaction, one projective representation of the space. The matrix allows for ease in our analysis by vectorizing the space, and represents a single snapshot of a static system, all quantities and prices are fixed. We call this space S, as in standard game-theoretic notation, and so the (full) strategy space for buyer i as all possible bids at all auctions: S i = Π j∈I S j i , and S −i = Π j∈I Π k =i∈I S j k as the associated opponent profiles.
The grid(s) of bid profiles, s, represents the statistical distribution of player types and corresponding actions, the userwise distributed state of actions in the secondary market. We will use the context of the bid to indicate the user type as well as the notation: s i is a buyer's bid, s −i ≡ [s j 1 , · · · , s j i−1 , s j i+1 , · · · , s j I ] j∈I is the profile of user i's opponents, and s j a seller's local auction. We describe the rules as follows: We will assume that a buyer's budget is sufficient, as the alternative would be to pay a higher price to the ISP.

Market Incentive
As a market with perfect with incomplete information, we determine that sellers can only gain information about the market by observing buyer behavior in their local auction. Buyers are able to see the sellers reserve price for each market in which they bid. The reserve price of each auction is determined by the valuations of the buyers, that is, the seller takes a passive, or reactive role, and modifies its reserve price according to market demand. Thus the buyer is able to determine the state of the market through the reserve price of its active auctions, and so may be able to infer some behavior resulting from opponent bid profiles. Our analysis focuses the role of buyers, who are able to directly influence global market dynamics. Each buyer i will have information from each seller j, as well as opponent profiles s −i , from each auction in which it is participating. In the extreme case, where i submits bids to all auctions j ∈ I, buyer i gains access all buyer profiles, [s 1 , · · · , s I ] for each auction j.
Define the set of sellers chosen by buyer i ∈ I as, and similarly, for a seller j ∈ I, we define the set of buyers participating in auction j as, where m, n ∈ I. We now must determine a function which regulates the behavior of the buyers in our dynamic market. We define an opt-out function , σ i , associated with a buyer i as part of its type. Buyer i, when determining how to acquire a possible allocation a, will determine its bid quantities by, (1) In a general sense, σ i applies the PSP rules to our user strategy. The rules presented here incorporate the opt-out function with the auction mechanism. The market price function, P i , for a buyer in the secondary market is: which we interpret as the aggregate of minimum prices that buyer i bids in order to obtain data amount z given opponent profile s −i . The maximum available quantity of data in auction j at unit price y given s j −i is given as: ( It follows from the upper-semicontinuity of D j i that for s j −i fixed, ∀ y, z ≥ 0, The data allocation rule is a function of the local market interactions between buyers and sellers over all local auctions, as is composed with i's opt-out value, so that for each i ∈ I, the allocation from auction j is, Remark 1. The bid quantity σ j i (a) and the allocation a j i are complementary.
Finally, we must have that the cost function.
The cost to buyer i adds up the willingness of all buyers excluded by player i to pay for quantity a j i , i.e., This is the "social opportunity cost" of the PSP pricing rule.

The Anonymity Problem
The PSP auction given in [3] is comprised of a set of simple and symmetric rules that closely follow market theory, and as it is distributed we require privacy to be computed on an individual basis, each user must be able to confirm its own anonymity. We describe the process as given in [13]. In general, a distributed computation, where buyer i is part of a coalition comprising auction j, is as follows: Denoting m −i = [(s j i , r i ), m 1 , · · · , m n ] k =i∈I , buyer sends a message to each of its opponents, where s j i is i's bid, r i is an independent random value, and m 1 , · · · , m n the messages i has received so far. Then, all buyers are able to confirm the winning bid s * i . It was proven in [13] that full privacy is not possible in a second price auction, even if we allow partial revelation and weak coalitions. We propose anonymity, in the winning bid only.

Buyers Are Anonymous
In our secondary market, we have that any local auction is anonymous by definition, as a permutation of the valuations results in a permutation of allocations and prices, equivalently, exchanging the bids of two losing buyers does not change the auction's result. Formally, Definition 1 ((Anonymous auction) [13]). Given an auction j and buyers i ∈ I, a protocol for computing max{i ∈ I : p j i ≥ p j k ∀ k ∈ I} if for all coalitions T ⊂ I, any pair of inputs x = [s j 1 , · · · , s j I ], ξ, so that ξ is a permutation of x, ∀ i ∈ T : x i = ξ i , and max(), and any choice of random inputs {r i } i∈T . LetT = T × I \ T, which states that any two inputs, the messages seen by coalition T are identically distributed.

The Winning Bid Is Trusted (Anonymous) Information
We claim that a buyer's trust in a local auction is fulfilled when the outcome of the auction is guaranteed to be correct, and if the winner's identity remains private information. For each local auction, we define a coalition to be the participating buyers. The winning bidder is chosen by distributed computation via homomorphic encryption. We present the Lemma in its general form, Lemma 1 ((Benaloh 1987)). f (x 1 , x 2 , · · · , x n ) = ∑ n i=1 x i mod p is privately computable.
Thus, it is possible to anonymously compute, Algorithm 1 presents the procedure determining the winner of auction j for some fixed time in the bid progression, where D j > 0.
Algorithm 1 Max bid private computation.

end for
10: e = ∑ i∈I j p j i mod (n + 1) (Lemma 1) 11: for i ∈ I j do 12: if p j i ≥ e then return i (winner) 13: end if 14: end for 15: end while 16: The winning buyer then leaves the auction, and so we have that the privacy of the winning buyer is persistent. We note that it is possible for a winner to anonymously rejoin an auction; however, this does not alter our result. At time t = 0, a seller j entering the market will submit bid s j κ = (D j , ) to the public data exchange platform, and so the initial bid s j κ , is public knowledge. The auction begins at time t > 0, and at t = 0, j will initializing its reserve price by executing a single bid iteration.
We will assume that the cost of participating in the secondary market is absorbed by the bid fee, which could represent data used in submitting bids, or a fee charged per unit of data, or a flat rate charged at the completion of the purchase. We do not model ISP revenue, but assume it may be extracted from the bid fee at t = 0.
The formulation is inspired to the thinnest allocation route for bandwidth given in [3]. We note that if a single seller j can satisfy i's demand, then (8) reduces to the original form, defined in [12] as "a simple buyer at a single resource element".

Truthfulness (Incentive Compatibility)
We will prove that the dominant strategy for buyers is to submit coordinated bids, where all bids the buyer submits are equal. Our motivation for coordinated bids comes from the idea of potential games. In potential games, the incentive of all users to change strategy can be expressed as a single global function. We map the incentive of a buyer over all auctions j ∈ I to a single potential function. This is a standard method that is used often, as it simplifies the analysis of both strategy and auction design. Thus, our strategic bid is an -best response. The necessary condition of an -best reply is that the new bid price must differ from the last by at least . Now, an -best reply for user i is p * i = θ i (σ i (a)) + , for a given opponent profile s −i , and for each j ∈ I i . Now, as is the bid fee, we have that p j i is equal to the marginal valuation of player i in auction j, and so incentive compatibility holds.

User Valuation (Strategic Incentive)
In any market, a buyer or seller would like to obtain the maximum amount of utility possible while staying within budget. The buyer's utility maximizes the amount of data allocated by the seller, while the seller's utility maximizes the cost of the data sold. We illustrate the resulting product space for the buyer in Figure 1 The level, or price associated with the buyer's bid may be projected onto a line. As we will show, this holds when buyers use the same bid price for all non-zero bids. The projection, or the amount of data requested, is a plane, since buyers may bid in more than one auction. Clearly, the allocation is the product of the price and the data request. The resulting step function is convex. We define a move to a better market position to be synonymous with a strategic bid.

Remark 2.
The terms "bid" and "strategy" are often interchangeable, from auction design and game theory, respectively.
Our mechanism allows a buyer to opt-out of auctions by submitting zero bids. This strategy maximizes utility while minimizing the number of positive bids submitted to the overall market. We define each buyer as a user i ∈ I with quasi-linear utility function u i = [u j i ] j∈I , a buyers' utility function is of the form, where the composition of the elastic valuation function θ i with σ i distributes a buyers' valuation of data allocation a across local markets (and thus multiple sellers). The composition map (the codomain of θ i (σ i ) is the same as the domain of σ i (a)) and restricts the buyer's domain to minimize d j p j − c i and so maximize u i . We formally extend the PSP rules described in [12] to determine the presence of equilibria across fully connected subsets of local data-exchange markets. By fully connected, we mean that the market subset maintains its own equilibrium without the influence of any other data-exchange (any other auction). The sellers, j ∈ I are not associated with an opt-out function. The sellers' strategy can only be to determine the reserve price of their local auction, using only information from buyers who have not opted out.

Remark 3.
It is possible that a seller would be able to derive information about other auctions by examining buyer bids over time, particularly if the seller had knowledge of the buyer strategy.
In this work, we assume sellers are unable to derive opponent information from buyer bids.
Elastic valuation functions allow for even infinitesimal changes in the market dynamics to be modeled. We give the definition for an elastic valuation function as in [3].

Definition 2 (Elastic demand [3]). A real valued function, θ(·)
and θ i is non-increasing and continuous, The elastic valuation of users and homogeneous nature of data in the secondary market allows for continuity in the constraints imposed by the user strategies. We begin our analysis with buyer valuation θ i . A buyers' valuation of an amount of data represents how much a buyer is willing to pay for that amount. This is equivalent to the bid price, given a fixed amount of data, satisfying θ i . We determine the buyers' utility-maximizing bid given quantity z ≥ 0 to be a mapping to the lowest possible unit price. We have, where ρ i (y) represents the demand function of buyer i at bid price y ≥ 0, and gives the quantity that buyer i would buy at a given price. We determine that the market supply function corresponds to an extreme of possible buyer demand, and acts as an "inverse" function of f i . We have, for bid price y ≥ 0, We note that f i is such that i could still bid in any auction j ∈ I. Therefore, the utilitymaximizing bid price is the lowest unit cost of the buyer to participate in all auctions, and corresponds to the maximum reserve price amongst the sellers.
From the perspective of the seller we have a more direct interpretation of valuation as revenue. We determine the demand function of seller j at reserve price y ≥ 0 to be, and define the "inverse" of the buyer demand function for seller j as potential revenue at unit price y, we have, and, unsurprisingly, f j maps quantity z to the highest possible unit data price. The valuation of any user must be modeled as a function of the entire marketplace. Naturally, a buyers' valuation is aggregated over local markets, and the sellers' valuation is aggregated over its own auction. We have already introduced the composition θ i • σ i as the valuation of the buyers. We further show that user valuation satisfies the conditions for an elastic demand function, with valuations based on (11) and (12). We first note that, in general (and so we omit the subscript/superscript notation), the valuation of data quantity x ≥ 0 is given by, as in [12]. Now, we have the following Lemma, Lemma 2 (User valuation). For any buyer i ∈ I, the valuation of a potential allocation a is, Now, we may define seller j's valuation in terms of revenue, We have that θ i and θ j are elastic valuation functions, with derivatives θ i and θ j satisfying the conditions of elastic demand.
Proof. Let ξ be a unit of data from buyer bid quantity σ j i (a). If ξ decreases by incremental amount x, then seller bid d j i must similarly decrease. The lost potential revenue for seller j is the price of the unit times the quantity decreased, by definition, f j (ξ)x, and so, Thus (14) holds. As we may use the same argument for (13), as such, we will denote f i = f j = f for the remainder of the proof. We observe that the function f is the first derivative of the valuation function with respect to quantity. Letting θ i = θ j = θ, the existence of the derivative implies θ is continuous, and therefore, in this context, f represents the marginal valuation of the user, θ . Also, clearly θ(0) = θ(σ(0)) = 0. Now, as we consider data to be an infinitely divisible resource, we have a continuous interval between allocations a and b, where a ≤ b. Now, as θ is continuous, for some c ∈ [a, b], , , and so as a ≥ 0, θ ≥ 0. Finally, we have that concavity follows from the demand function. Then, as θ is non-increasing, we may denote its derivative γ ≤ 0, and taking the derivative of the Taylor approximation, we have, The sellers' natural utility is the potential profit, or simply u j = θ j , where we have chosen to omit the original cost of the data paid to the ISP, as it is not a component of our mechanism, and as a discussion of mobile data plans is outside the scope of this paper. Now, a rational user will try to maximize its utility, thus, user incentive manifests as a response to market dynamics. A buyer has the choice to opt-out of any auction, and as a seller will try to sell the maximum amount of data, the highest possible reserve price is conditioned by "natural" constraints. Utility-maximization acts as revenue maximization for a rational seller, and as cost minimization for a rational buyer. Thus, for each user p j i ≥ min p j i ) and p j i ≤ max p j i ), which holds ∀ i, j ∈ I such that s j i > 0. Now, rational buyer does not want to purchase extra data, as this would be equivalent to overpaying, however i submits positive bids to a set of sellers, and a rational seller will attempt to maximize profit, and so will try and sell all of its data. Therefore, which holds ∀ i, j ∈ I. We will assume that buyers and sellers do not overbid, and so omit this constraint from our formulation. Thus, at equilibrium all users are satisfied, and D j = D i , although we observe that this result does not imply that s i = s j . Finally, it is worth mention that the analysis of the auction as a game assumes some forms of demand and supply, in order to derive properties. The mechanism itself does not require any knowledge of user demand or valuation.

User Behavior
The user local strategy space is non-deterministic: the preferences of users are subject to change, determinations and predictions are based on the binary dependence of the variables. Arrow's Theorem states that no deterministic strategy can provide a mapping of the preferences of users into a market-wide (complete and transitive) strategy. As individual bids cannot map to a general objective, a better market position can only be determined by an adaptive strategy. We will address the market risks and securities in our secondary data exchange market, and provide a game-theoretic model of a real market progression, which we then use to derive, and then define, adaptive variables.
Assuming equal bandwidth for all users, we derive a globally optimal strategy suited for users with local information in a distributed data-sharing model. In a multi-auction market, each auction a buyer joins has the possibility of decreasing the potential cost of its data. However, increasing the size of the auction implies a certain risk, which we may interpret as a definite liability. Increasing the number of transactions causes additional messaging overhead, fees, and increased competition from other buyers. A transaction also causes potential indirect costs, which may be considered work done to find sellers, or effort of communication from participation. A seller has the potential for greater profit with each new buyer in its auction, taking the same risk. To simplify our analysis, here the liability of any user is naturally absorbed into the bid fee , as in [12]. Therefore, according to our interpretation, the bid fee is dependent on the association between two users and their market positions, in addition to the underlying network structure. Now, both sellers and buyers must consider the cost of adding additional users to their subsequent pools.
Buyer i's seller pool is determined by minimizing n, and is the smallest set of sellers that allows for a coordinated bid, and the aggregate bids satisfy its demand, D i .
Similarly, seller j determines the minimal set of buyers that maximizes revenue and sells all of its data, D j .
We further determine that the set of buyers and sellers participating in a single equilibrium is bounded by the potential indirect costs of participation. We will denote this individual cost to each user as . The indirect cost is the portion of the bid fee that is dependent on the underlying network and the individual. Observing that indirectly effects user utility, and therefore acts to establish a natural budget for each user. We define this constraint as, which may be interpreted as the effort a rational user is willing to expend on its message space, and serves to limit the size of the buyer/seller pools. This information may be collected from a specific device's configuration, i.e., enabled roaming, daily data restrictions. It is clear that an unconstrained market, even with a finite number of users, could suffer from the expense of many local auctions trading an infinitely divisible resource, thus is interpreted as the "liability" component of , and attempts to regulate network congestion.

Buyer Strategy
Although it is possible for a seller to fully satisfy a buyer i's demand, it is also reasonable to expect that a seller may come close to using their entire data cap, and only sell the fractional overage. In this case, a buyer must split its bid among multiple sellers. The buyer strategy bids in auctions with the highest quantities first, a natural exploitation of the demand curve. A new seller entering the market with a large quantity of data will be in high demand. This behavior contributes to market price stability, as seller valuation is determined by buyer demand, the buyer strategy tends towards equal valuation of all local markets, and therefore similar prices. If a buyers' demand is not satisfied, they will need to bid in markets with smaller data quantities, and so will bid on a larger portion of the sellers' bid quantity, increasing their unit price. We define j * = n ≤ I represent the seller with the least amount of data ∈ I i , i.e., D j * ≤ D j , ∀ j ∈ I j . We define the composition, to be the buyer strategy with respect to quantity for all sellers j ∈ I i . We propose the following strategy.
Lemma 3 (Opt-out buyer strategy). Let i ∈ I be a buyer and fix all other buyers' bids s −i at time t > 0, and let a be i's desired allocation. Define, and bid price p Each time step, s j , the vector of bids held by auction j, is updated and is shared with all participating buyers. At this point buyers have the opportunity to bid again, where a buyer that does not bid again is assumed to hold the same bid, since a buyer dropping out of the auction will set their bid to s j i = (0, 0). The implementation of the Opt-out buyer strategy is presented in Algorithm 2.
Proof. We assume that a buyer will try and fill their data requirement. In the case that there exists a seller who can completely satisfy a buyers' demand, j * = 1, |I i | = 1 and (16) holds. If such a buyer does not exist, as the set I i is ordered by the quantity of the sellers' bids, i may discover j * by computing I i . Suppose that D i > ∑ j∈I D j , then j * > I and I i = ∅. We model the ISP at time t > 0 as a seller κ with bid s κ = (d κ , p κ ), where d κ > D j , ∀ j ∈ I i , and p κ represents the price for data set by the ISP, which we note is also the upper bound of the sellers' pricing function. We note that in [14] this cost is the data overage fee. Consider some k = i ∈ I where p j i = p j k . The allocation rule (5) determines that the data will be split proportionally between all buyers with the same unit price. It is possible that the resulting partial allocation of data to i and k would not satisfy some demand. As the two cases i and k are the same, we will only consider one. Suppose seller j updates its bid to reflect the new data quantity, where d i (a). First, i sets its bid to s j i = 0, and from the new subset I i , submits bids until ∑ j∈I i σ(a) j i ≥ D i , by (15). Now, we consider the case where a new buyer k with bid price p j k > p j i for some j ∈ I i , in other words, a new buyer k may enter the market with a better price, decreasing the value of i's bid for j ∈ I i . In this case, by (16), i will choose I i so that, σ k (a), and so I i is large enough to balance the additional demand from k. Finally, we consider the case where |I j | = I, where the demand of buyer i exceeds the supply, and the case where σ i ( ) > θ i (σ i (a)), where the overhead exceeds the current valuation of the data. Then, by (9), the valuation of the data increases until either the demand is satisfied, the debit from the overhead costs are balanced (18), or the upper bound of the sellers' reserve price p κ is reached. Thus, as in each case we have that i is able to satisfy their demand, and we determine that the opt-out strategy is optimal.
Finally, we note that I i is not the only possible minimum subset ∈ I able to satisfy i's demand, in fact, by restricting the size of the set I i , we would be able to improve the computation time of buyer i, at the cost of increasing the price. Algorithm 2 Buyer response. t ← t + 1 13: end while

Seller Strategy
We define the reserve price for seller j as, where i * is the highest losing bidder with respect to bid price. We claim that the choice of reserve price p j * does not force any buyers out of the local auction. In order to maximize revenue, the seller must also be able to respond dynamically to strategic bids. In order to do this, we determine that the seller may modify its reserve price in response to the changing market dynamics.
Define any auction duration to be τ ∈ [0, ∞). We will show that sellers are able to maximize revenue in restricted subset of buyers in I, and as such will attempt to facilitate a local market equilibrium for this subset. A local auction j converges when ∀ i ∈ I, s j(t+1) i = s j(t) i , at which point the allocation is stable, the data is sold, and the auction ends. In the sellers' local environment, we determine that the best course of action is to maximize revenue, and then try to keep its buyer pool stable until convergence occurs. Lemma 4 (Localized seller strategy (i.e., progressive allocation)). For any seller j, fix all other bids [s k i ] i,k =j∈I at time t > 0 ∈ τ. For each t ∈ τ, let ω(t) be given by (7), and perform the update, Allowing t to range over τ, we have that D j = 0, and a local market equilibrium.
Consider a user purchasing data from a subset of other network users. The sellers' auction will function as follows: at each bid iteration all buyers submit bids, and the winning bid is the buyer i that has the highest price p j i . The seller allocates data to this winner, at which point all other buyers are able to bid again, and the winner leaves the auction (or equivalently, maintain their bid). The auction progresses as such until all the sellers' data has been allocated. The seller progressive allocation algorithm is given in Algorithm 3.
Proof. We assume that the seller will try to maximize its revenue. In the case where |I j | = 1, then if σ j i (a) = D j , then j's market is at equilibrium. Otherwise, we arrive at the case of multiple buyers, which we note includes the case where σ j i (a) < D j , which is reflected trivially here.
For auction j with multiple buyers, i * is the losing buyer with the highest unit price offer, determined by (17), Suppose that for some i ∈ I j , buyer demand is not met. In this case, by (15) the seller must notify i of a partial allocation by changing the bid vector at index i. With this caveat, and Proposition 3, we have that the aggregate demand of subset I j is satisfied by seller j. Although the buyers' valuation θ i is not known to the seller, we will assume that buyers are bidding truthfully, and so the new reserve price p j i * + = θ i * + . For clarity, let the reserve price be denoted by p j * . Now, by the elasticity of (9) and (12), we have that, ∀ z ≥ 0, f i * (z) < f j (z) ≤ f i (z), which holds ∀ i ∈ I j , and ∀ j ∈ I i . We claim that the choice of reserve price p j * does not force any buyers out of the local auction.
To show this, we use the assumption of truthful bids, and the fact that since the auction begins at time t > 0, buyers will bid at least once. As will be addressed in further analysis, we assume that a new bid price differs from the last bid price by at least . Suppose the auction starts at equilibrium, so ∑ i∈I j σ j i (a) = D j at time t = 0. The reserve price p j * set at time t = 0 begins the auction with the first bid iteration, and so at t > 0, ∀ i ∈ I j , we have that p j i − p j * ≥ . Now, in the case where at t = 0, ∑ i∈I j σ j i (a) > D j , by (5), the seller notifies (any) buyer k with the lowest bid price of a partial allocation by changing d j k thus by Proposition 3, k either decreases its demand or increases its valuation until σ j i (a) ≤ d j i . Then, as the seller computes the set I j at each time step, a new i * may be chosen and the buyers bid again. Suppose ∃ k ∈ I j such that ∀ l ∈ I k , i I l ∀ i = k ∈ I j . That is, k is disconnected from all other buyers i ∈ I j , and suppose that d j k is partial allocation at t > 0, and further suppose that there are many l ∈ I k where |I l | > |I j |. The more buyers an auction has, the more likely that cases will occur that cause buyers to rebid, particularly if auctions l ∈ I k have overlapping buyers, then k may opt-out of auction j, i.e., s j(t) k = s j(t+1) k = 0, then the seller may simply return the tentatively allocated data to D j . Finally, we note that if for some i ∈ I j ∃ k ∈ I j such that p j i = p j k , then the seller again notifies the buyers of a partial allocation by changing d j i and d j k by (5). Thus we determine the valuation between seller j and buyer i is well-posed, the reserve price (20) is justified, and we have a local equilibrium at time τ.

Remark 4.
In the case where market resources do not satisfy (15), we reason that in the case of insufficient data in the market buyers may wait for additional sellers or purchase from the ISP, κ, as a monopoly sale. Similarly, in the case of insufficient demand, where we may assume that data is held at time t = 0 by κ at bid price .

A Simple Example
Example 1. Finally, we give an additional simple example of convergence to a local market equilibrium, where the buyers are assumed to respond with their truthful, -best replies. The data for this example is shown in Table 1.
At t = 4 the auction ends.

Individual Rationality/Selfishness
We conclude this portion by examining the relationship between the strategies of buyers and sellers in local auctions. We have proven that a buyer cannot have a negative utility. Our strategic framework creates an incentive for the seller to maintain a local equilibrium, where supply equals demand. A truthful bid implies that the new bid price differs from the last bid price by at least . As a seller must distribute bid vectors to all buyers in its auction, we reason that the seller may employ a strategic caveat. The seller will notify a buyer who is subject to a market shift by changing its bid at the appropriate index. As we have shown, the seller is a functional extension of the buyer, with rules determined by the buyers' behavior. This gives an auction j a natural logical extension into the global market through its buyers. We demonstrate that the symmetry between buyer and seller behavior, consequently strategies, stretches into a symmetry across subsets of local auctions. Value is modeled as a function of the entire marketplace: a buyer's valuation is aggregated over all the auctions, and the seller's valuation is aggregated over its own auction. We must ensure that a user's private action satisfies the conditions of a direct-revelation mechanism, as well as adheres to the collective goals. We show that, from Lemma 4 and Definition 3, an individual user will contribute to local stability, given global market dynamics S.
We model the impact of the dynamics of S of the data-exchange market on a local auction j. The market fluctuations from S give auctioneer j the chance to infer information about the global market. We identify a clear bound restricting the range of influence that local auctions have on each other. Consider a single iteration of the auction, where a seller updates bid vector s j , and the buyers' response s i , to comprise a single time step. We have the following Proposition, Proposition 1 (Valuation across local auctions). For any i, j ∈ I, Fix an auction j ∈ I with duration τ and define the influence sets of users. The primary and secondary influencing sets are given as, Define ∆ = Λ ∪ λ. Fixing all other bids s j i ∈ I, and time t > 0 ∈ τ, we have that, Proof. As this is our main result, we provide an outline of the (exhaustive) proof, illustrating the most important case, when a market shifts affect auction j, and the direct influence of the shift on the connected subset of local markets. A local auction j ∈ I, is determined by the collection of buyer bid profiles. Using Lemma 4 and (22), we have that, where we define i * as the losing buyer with the highest bid price in auction j. By (9) p j i ≥ p j i * + , thus p j i < p j i * can only happen during a market shift. Consider k ∈ I j at time t where, for example, some buyer(s) enter the auction, and so (25) implies that ∑ i∈I j σ j i (a) > D j . Now, p j i < p j i * ⇒ k I j and s j k > 0 will cause k to initiate a shift. By Definition 3, k will set s j k = 0, and begin to add sellers to its pool. Suppose that at time t, j's market is at equilibrium. Unless k adds a seller with a higher reserve price within |I j | time steps, by (21), the auction ends. We have that, ∀ i ∈ I j , s j i > 0 where i I j , and (22) holds. Now, the subset I j ⊂ I determines j's reserve price p j i * . We will assume the buyer submits a coordinated bid, using (5). The reserve price (20) of seller j is determined at each shift, and is the lowest price that j will accept to perform any allocation. Let p j * denote the reserve price of auction j and p * i denote the bid price of buyer i, i.e., p k i = p * i , ∀ k ∈ I i . Using Lemma 4, for each i ∈ I j , we have from (9), (12), that p * i ≥ p k * , ∀ k ∈ I i . In the simplest case, consider a disjoint local market j, where ∀ i ∈ I j , s k i = 0, ∀ k = j ∈ I i ⇒ Λ = {j} and λ = I j . Again using (9) and (12), it is clear that θ i = θ j , ∀ i ∈ I j . In all other cases, the sellers ∈ Λ are competing to sell their respective resources to buyers whose valuations are distributed across multiple auctions. The bid price of buyer i ∈ I j is determined by, . Λ is the set of sellers directly influencing the bids of buyers in auction j. Now, the reserve price for auction j is such that, p j * ≤ min i∈I j (p * i ) − . From (23), Λ is defined by a seller j ∈ I, where each user k ∈ λ has some direct or indirect influence on j.
Consider the set λ j . For some buyer i ∈ I j , and then for some seller k ∈ I i , we have a buyer l ∈ I k . By (22), i, l ∈ I k , and so the reserve price p k * ≤ min(p * l , p * i ), and k, j ∈ I i ⇒ p * i ≥ max(p k * , p j * ). Suppose that l I j ⇔ j I l , so that p * l < p j * , and the valuation of buyer l does not impact auction j and vice versa, i.e., θ j l = 0. Since l ∈ I k , p * l ≥ p k * ⇒ p k * < p j * , and i ∈ I j ⇒ p * i ≥ p j * . Therefore, we have that the ordering implied by (23) holds, and, for any buyer l ∈ λ j such that l I j . We use a similar argument for a secondary user q ∈ I l . Finally, consider the subset Λ j ; a shift occurs in 2 cases. (1) If i ∈ I j decreases its bid quantity so that ∑ i∈I j σ j i (a) < D j , and (2) if buyer i * , defined in Lemma 4, increases its valuation so that p j i * < p j * . Fixing all other bids, a decrease in q's demand will directly impact buyer i. If at the end of the bid iteration, we still have that i is the buyer with the lowest bid price, then (12) holds and j's valuation does not change. Otherwise a new i * will be chosen upon recomputing I j , as a consequence of Definition 3 and Lemma 4, and the market will attempt to regain equilibrium. We determine the influence of ∆ k * on ∆ j by (25).
In each case we have that (9) and (12) hold for some fixed time t, and so, ∀ i ∈ I j , any bid outside of our construction has a zero valuation, with respect to buyers ∈ λ and sellers ∈ Λ, and therefore cannot cause shifts to occur except through a shared buyer, e.g., some l ∈ I k . Thus, in all cases, (9) and (12) hold. Fixing all bids in any auction where q Λ j , and Thus, with a slight abuse of notation for clarity, where the result follows by construction, and the continuity of θ .
For completeness, in the case where the ISP κ does not adhere to the market dynamics, so p κ > p j + , ∀ j ∈ I, then we may absorb the overage (difference) as part of the bid fee.

Locally Fair Division
We claim that the allocation a by seller j for a local auction at equilibrium is an equitable division, a fair division where each buyer equally values their valuation. We have that equitable division holds from (27) Proposition 1.

Social Welfare Maximization
We define an optimal state of social welfare to be when valuations are equal across a subset of local auctions. Then, ∆ ⊂ I to be a subset of users where an optimal social welfare is achieved.

Social Welfare Maximization (Exclusion-Compensation)
We define an optimal state of social welfare to be when valuations are equal across a subset of local auctions. Then, ∆ ⊂ I is the subset of users where social welfare is achieved. We finally have: Corollary 1 (∆-Pareto efficiency). The subset ∆ ⊂ I is Pareto efficient, in that no user can make a strategic move without making any other user worse off.
Proof. Define s * = (z * , θ * (z * ) as the set of truthful -best replies for user i given opponent bid profile S −i , where ∀j ∈ I i , s j * = s * . Since θ i is continuous, as was shown in Lemma 2, and as s| ∆ = {[s j i ] ∈ λ j × Λ j } is continuous in s on S k = Π k∈λ j S j k , then given that s * = s * = ( f * (p * ), p * ) = (z * , θ (z * )), we have that s * is truthful. The result now follows directly from the result of Proposition 1.

Equilibrium Analysis
We intend to show evidence shared network optima (a global optimum). A buyer i ∈ I will have incentive to change its bid quantity if it increases its opt-out value σ i , and therefore its utility (8). We will show that, without loss of utility, buyer i may use a "consistent" bid strategy within its seller pool, i.e., d j i = d k i , ∀ j, k ∈ I i , and as such, Proposition 3 supports an optimal strategy with respect to (8). Our result shows that a buyer may select I i in order to maximize its utility while maintaining a coordinated bid strategy. Reasonably, if j * < I, a buyer may increase the size of its seller pool I i , thereby lowering its coordinated bid quantity while obtaining the same (potential) allocation a i . As buyer i submits identical bids to multiple auctions, the bid price must be as high as the highest reserve price p j i ∈ I i . Buyer i's bid then has identical bid price p j i ∀ j ∈ I i . We further note that i optimal strategy does not require reducing its bid price to a minimum in each auction, where the bid quantity σ j i (a) is still fulfilled. The pricing rule of the PSP auction dictates that a buyer i will pay the cost of excluding other players from the auction, and as i's bid price reflects its valuation of it data requirement D i across all local markets, we have identical bid prices in each auction where s j i > 0. Obviously, if j I i , then θ j i = 0.
Lemma 5 (Opt-out buyer coordination). Let i ∈ I be a opt-out buyer and fix all sellers' profiles s j . For any profile S i = (D i , P i ), let a i ≡ ∑ j a j i (s) be a tentative data allocation. For any fixed S −i , a better reply for i in any auction is and where i's strategy is as in Proposition 3.
The proof follows closely the work in [12].
Proof. As s −i is fixed, we omit it, in addition, we will use u ≡ u i ≡ u i (s i ) ≡ u i (s i ; s −i ).
In full notation, we intend to show Now, if there exists a seller who can fully satisfy i's demand, then |I i | = 1, and the case is trivial as no coordination is necessary for a single bid. Otherwise, buyer i's demand can only be satisfied by purchasing data from multiple sellers. We will show that i may increase |I i |, and so decreasing d j i , ∀ j ∈ I i , without decreasing ∑ j∈I i u j i . Buyer i maintains ordered set I i where the sellers with the largest bid quantities are considered first; the index of seller j * defines a minimal subset I i , satisfying (16). By construction, d j * i is the minimum quantity bid offered by any j ∈ I i . Thus by (16) and (19) The buyer valuation function (13), guarantees that ∀ j ∈ I i , y j i ≥ p j i * , where p j i * is the reserve price of seller j, defined in Proposition 4, and is by definition the minimum price for a buyer bid to be accepted. AsD j i is non-decreasing, ∀ j ∈ I i , k I i , . Thus (32) holds and so, by (5), where the last equality is by definition, and so (30) is proven.
thus (31) simply shows that changing the price p j i to y j i does not exclude any additional buyers, as the bid p j i was already above the reserve price of any seller j ∈ I i . We proceed to show that x i does not result in a loss of utility for buyer i, that is, (z i , y i )), and so, , which holds ∀ j ∈ I i . Therefore, by the definition of utility (8), and the buyers' valuation (13), The property of truthfulness is an essential component of equilibrium in second-price markets. The strategies described in this paper have removed the necessity for a user to determine its own valuation function, we intend to show that the market dynamics resulting from the construction of the user strategy space results in truthful bids that are optimal for all users, i.e., bid prices are to the marginal value as determined by market dynamics. To achieve incentive compatibility, we find that the opt-out buyer must choose We have so far only made the assumption of truthful bids throughout our analysis. As was shown in Proposition 1, a buyer only has incentive to change its bid as a result of a market shift or partial allocation. In a truthful reply, the term /θ i (0) ensures that a new bid price differs from the last bid price by at least , thereby ensuring that a buyer does not change its bid without correcting the effects of unstable shifts. For any buyer i, it suffices to show the continuity of the set of truthful -best replies in the set of opponent bid profiles. So, for a buyer i, define the set of possible -best replies, and the set of truthful bids, where ∧ denotes the logical "and" operator. We note that the "strategic" set T i is restricted by Proposition 3. We have the following Proposition, Proposition 2 (Incentive compatibility across local auctions). Let Λ, λ be defined as in Proposition (1), and fix time t > 0 ∈ τ, and fix s j , ∀ j ∈ Λ, and for some buyer i ∈ I j , let s l also be fixed ∀ l i ∈ λ. Define, and z = sup(χ i − /θ i (0)) + , and for each j ∈ Λ, v j i = σ j i (z), and w j i = θ i (z). Then a (coordinated) -best reply for the opt-out buyer is t With reserve prices p j > 0, there exists a "truthful" strategy game embedded ∈ ∆. Therefore, a fixed point ∈ ∆ is a fixed point in the multi-auction game.
Proof. We claim that t i is an -best reply for buyer i. That is, As a result of auction initialization, a seller j's valuation defines its reserve price to be determined by a buyer i λ, even if this price is zero, we have that p j = ≥ 0 ∀ j ∈ Λ. Let z = sup(χ j i ), and again let p j * = f j • σ j i (a) denote the reserve price of auction j, and p * i = f i • σ j i (a) denote the (coordinated) bid price of buyer i. We have that i ∈ I j , and (9) defines θ i (z) as being max of the reserve prices p j * , ∀ j ∈ I i , therefore (35) is such that, which implies, as θ i is non-increasing and P j i ≥ 0, we have ∀ j ∈ I i , And so, by (5), Therefore, ∀ j ∈ Λ and ∀ i ∈ λ such that (27) and (28) It follows that, For concave valuation functions, the first-order derivative of θ at point 0 gives the maximum slope of the valuation function, and so the factor /θ (0) guarantees that new bids will differ by at least , and as such, buyer i will remain in any local auction with reserve price determined by (20). We therefore verify that, and as P j i ≥ 0, we have that, from the construction of ζ, , also a contradiction of (35), and so buyer s i cannot exist. Finally, as we may consider ∆ ⊂ I to be a multi-auction game, our user strategies form a "truthful" local game with strategy space restricted to -best replies from buyers ∈ λ. Therefore we have that a fixed point in the "truthful" game is a fixed point for the auction.
In linear analysis, we may determine a Nash equilibrium by finding a local optima of the potential function. Additionally, as the potential function also iterates, it may be used in an analysis of convergence. The convergence of a Nash equilibrium results from the progression of -best replies, where each subsequent bid is a unilateral improvement, provided that t i is continuous in opponent profiles. From the original proof by [3], we observe that the collection of unconstrained truthful bids may be a subset of the collection of -best replies, i.e., T i ⊂ S i . Now, the strategy space is comprised of a collection of bid, or "strategy", vectors that together, may be represented as a collection of potential functions, where change in buyer i's utility, resulting from a change in strategy, equals the change in the local market objective of each seller j ∈ I i . These local objectives are known as potential functions, and are formulated by mapping the incentives of all users in a local auction to a single function. The goal of our analysis is to therefore construct a global potential function that encompasses all local markets, and show that this space adheres to the construction described in our proof. The conditions of convexity, connectedness and continuity must apply to the global market space in order for a global equilibrium to exist.
In order to address continuity in a global sense, we must again demonstrate continuity in the construction of our model. We will show that our global market holds a differentiable topology, where our opt-out function σ extends to an injective, differentiable map. We show that locally, the connectivity of our market subspace ∆ provides a linearization, or approximation of a linear map, and so continuity holds in the global sense. We construct an extension and determine the existence and uniqueness of a global market objective by mathematical correspondence. We begin with the definition of correspondence, Definition 3 (Correspondence). A correspondence is mathematically defined as an ordered triple (X, Y, R), where R is a relation from X to Y, i.e., any subset of the Cartesian product X × Y.
In an economic model, a correspondence (S i , S −i , R) defines a map from S i to the power set S −i , where R is a binary relation, i.e., R ⊂ S i × S −i . The classic example of a correspondence in our model is the buyers' best response B i , where, for the multi-auction, S i and S −i are built by repeatedly using the Cartesian product over bid profiles. The power set S −i = Π j Π k =i S j i ) arises naturally from the product of ordered sets. The binary equality relation i ∼ j naturally occurs in the strategy space, and is both an equivalence relation and a partial order, and therefore is reflexive, transitive, symmetric and antisymmetric. We use the the axiom of set equality based on first-order logic, which states that, ∀ i ∈ I, ∀ j ∈ I, (i ∈ I j ⇔ j ∈ I i ) ⇒ i ∼ j, and follows from (22). Given any set of buyers I i ∈ Λ where we have an allocation from some j ∈ λ i , Given a subset B of a set A, the injection f:B->A defined by f(b)=b for all b in B is called the inclusion map. 1 λ (S i , S −i ) : λ → Λ ∈ S/ ∼, and so is a canonical mapping as well as an inclusion map. The product topology of the strategy space is preserved, and the set of all indicator functions on S forms the power set P (S) = S i × S −i on S defines a quotient space, and forms the partition s j ∈ S : s j ∼ s i of S. Now, ∆ ⊂ P (S) is the result of the correspondence map, and we have that set of users in an auction is uniquely determined by its members where sellers have fixed market prices; all users who are not changing their bids are considered equal. Therefore each seller j ∈ I is equivalent to some buyer i ∈ I; buyer i's utility constraint is satisfied in auction j if and only if seller j's utility constraint is also satisfied.
The best response is a reaction correspondence defined by the mixed-strategy game. Denoting T i = T i ∩ B i , we have the set of truthful -best replies in opponent bid profiles S −i . A natural induced topology of this space is the product topology, e.g., the canonical map S i → Π j∈I S j . Now, in order to find a fixed point in the mixed strategy space, we must have a continuous mapping, i.e., Λ j ⇐⇒ λ i , ∀ i, j ∈ ∆. The data-sharing market consists of inter-dependent sets of multi-auction games around possible fixed points. Clearly, the union of all possible sets j∈I ∆ j covers I. We claim that the shared buyers between the different subsets ∆ form a sufficiently connected set, so that Proposition 1 holds. We have the following Lemma.
Lemma 6 (Continuity of -best reply on ∆). Let ∆ be defined as in Proposition (1). For any buyer i ∈ λ j , the collection of bids B i is continuous in S −i Proof. Define σ i • P = max i∈I j θ i (0), andP i (z, s i ) = P = − , where is the bid fee, and is i's liability estimate for auction j ∈ I. We observe that is a product of closed subsets of compact sets. Now, we have that a closed subset of a compact set is compact and the resulting product topology gives Tychonoff's theorem, i.e., every product of a compact space is compact, we have σ i • B i is compact subset of B i . Now, letting P = max i∈λ j θ i (0), and we have by definition of ∆ and the product, The result follows from the fact that t i is continuous in s i , as was proven in [12], and as a finite union of compact sets is a compact set.
We have proven that buyers will submit bids according to their marginal valuations. We have that all bids represent -best replies, and, as was proven in [3]. The sellers' positive reserve price implies that bids are truthful. Finally, by properties determined by the construction of a mixed strategy symmetric game with a two-dimensional message space, we may now restrict our analysis to the set of continuous, truthful, -best replies, T . In mathematics, the notion of the continuity of functions is not immediately extensible to multivalued mappings; we show the correspondences between the two sets λ and Λ. The correspondence between i and j forms the set λ ∼ Λ. We note that due to the binary relation, the set of all possible -best replies, is well-posed by [15] Definition (4.3) and Corollary (4.4). We show that our bidding strategy results in (at least one), Nash equilibrium, where again the sellers reserve prices are fixed.
Lemma 7 (∆ -Nash Equilibrium). Let ∆ be defined as in Proposition (1), and suppose that auction j ∈ ∆ is not in a transient state, e.g., t = τ j . Fix all s k i , k = j. Using the rules of the data auction mechanism, along with type-based strategic moves, j converges to an -Nash equilibrium. The proof follows closely that of [12].
Proof. As auction j is at equilibrium, and since θ i is continuous, as was shown in Lemma 2,  [12], which states that the continuous mapping of a convex compact set into itself has at least one fixed point. Therefore, ∃ some k = i such that z * = σ * (z) ∈ [0, D k ] i∈Λ j . Then, given that s * = (z * , θ (z * )), we have that s * = t(s * ) ∈ T.
The rules of the PSP multi-auction drive market mutations that evolve and are regulated by the user strategies. As a result of user behavior, and subsequent strategies, we determine that the data-exchange market behaves in a predictable way. We point out the need for better management of data on the consumer level. It is obvious that there is profit to be made by supplying data to the data-driven consumer. Mathematically, we have shown that if truthfulness holds locally for both buyers and sellers, i.e. p i = θ i , ∀ j ∈ I i and p j = θ j , ∀ i ∈ I j , then, in the absence of market shifts, there exists an -Nash equilibrium extending over a subset of connected local markets. However, each auction may be played on the same or on a different scale in valuation, time and quantity, and so the rate at which market fluctuations occur is impossible to predict. This presents a problem, as in our linear analysis we rely on the stability of the market equilibrium at a fixed time to find a convergent sequence of -best replies within any auction j, whereas in the global market discontinuities may occur when we have I i ∩ I j = ∅. In this case, we must address the market using a non-linear analysis. Up to this point, we have constructed our proofs around connected local markets, such as in 1, where we defined connectivity via a set of influencing users Λ and λ. The result was the existence of a sequence of vector-valued functions on the union of the influencing sets, ∆, allowing for the requirements of differentiability and therefore continuity to hold, resulting in a fully connected subset of local auctions.
For each ∆, the Kuhn-Tucker optimality conditions imply that s i is the optimal response of player i to s −i if and only if there exists a Lagrange multiplier ρ i such that: where ρ turns out, in fact, to be the (stable) marginal price [16]. Without loss of generality, we will consider adding data in such a way that the ordering of the sets λ and Λ is preserved. That is, the buyers bids are such that s 1 ≥ s 2 ≥ · · · ≥ s I . We may even define a function N : ∆ → R S that assigns each s ∈ S ∆ the Nash equilibrium N (s) of its respective game. Each assignment induces a game with a unique Nash equilibria. We consider disjoint sets {∆}, we construct an extension so that for any influencer i ∈ ∆ , there is an extension such that for k ∈ ∆ k such that the dominant strategy for i ∈ ∆ j×k . We construct our extension in the form of a new user type, a broker type. A broker type fills the space between ∆ j and ∆ k by purchasing data from one auction subset and selling it in the other. This user performs the function of connecting two fully-connected auction subsets ∆ j and ∆ k by supplying additional data from one auction (∆ j ) to the ordered set I j of each seller in each auction j ∈ ∆ k . We show that this additional broker type preserves the optimality of the set ∆ j ∪ ∆ k . Suppose that the broker assumes that there is an infinite amount of data available to buy and creates bids on the assumption that a market ∆ will be available to fill the data request. The broker may create orders that are not feasible in the actual market, causing buyers in ∆ to shift their bids according to the (presumed) available data. In this way, the broker may actually plan the data requirements, overage or underage, based on some finite scheduling scheme. This concept is beyond the scope of our current research, but merits some future consideration. In this case, the broker can only add data δ to ∆ from the set {d ∈ R I + : s 1 ≥ · · · ≥ s I ; (δ i , ·) ≥ (d i , ·); ∑(d i − δ i ) ≤ δ}. We are presented with the problem of how to add additional data to ∆ that is optimal with respect to its Nash equilibrium N ∆ , as in [17]. For each optimal strategy s, the unique Nash equilibria N ∆ (s) describes the allocations of data D j from each seller j in ∆.
We begin by examining the addition of data to a single market subset. We will show that this strategy, which we will call s * , is therefore userwise price optimal for the entire space N (s) ∀ s ∈ S. We show that, under certain conditions, the transfer of data happens in an "ordered" way, so that the natural price ordering of the space is preserved and thus, the Nash equilibrium. In particular, there exists a Lagrange multiplier ρ * such that (36)-(38) hold.
Theorem 1 (∆ * -Nash Equilibrium). Let ∆ * = ∆ j ∪ ∆ k be a union of market subsets at equilibria. Let A * ∆ (s) be an allocation where a bidsŝ j = (p j ,d j ), are augmented such thatd j = d j − δ i and δ i is such that ∑ j∈∆ jâ p * l ≥ p j * ⇒ p j * <p k * , and i ∈ I k ⇒ p * i ≥p k * . Therefore, we have that the ordering implied by (23) holds, and,p j * ≤p * l <p k * ≤p * i , for any buyerl ∈ λ k such thatl I k . Market shifts will occur due to the new reserve prices chosen in auctionk according to Proposition 1 until the market reaches equilibrium, and so (41) holds ⇒ (39) holds. In effect, the transfer of data has forced the reserve prices of Λ j and Λ k to "squeeze" together, with the broker profiting off of the difference. Sellers in Λ j lower their reserve prices, according to the lower demand. At the same time, buyers in λ k lower their bid prices according to the increased supply of data. The sets Λ k and Λ j are connected via auctionk, and so the reserve price determined in auctionk will affect Λ j through the bid price of buyers inÎ. We have, by transfer of data, for all i ∈ ∆ * , i (x) dx < , and, i (x) dx < .
Using Proposition 1, we may conclude that equilibrium is achieved and so (36)-(38) hold for the sets ∆ j and ∆ k connected through auctionk, and we have the existence of at least one Nash equilibrium in ∆ * .
In this scenario, the presence of a broker causes the two sets ∆ j and ∆ k to become connected, arriving at a Nash equilibrium for ∆ * = ∆ k ∪ ∆ j . These connected sets are defined by the influencing users around the auctions k and j, and are dynamically defined as such. This complicates the analysis and makes it difficult to determine stability in time. By restricting the transfer of data to two auctions within two auction subsets, we manage to create some sort of structure in the underlying market dynamics that is intuitively simple, however analytically difficult to describe.

Conclusions and Future Work
Mathematically, we have shown that if truthfulness holds locally for both buyers and sellers, i.e., p i = θ i , ∀ j ∈ I i and p j = θ j , ∀ i ∈ I j , then, in the absence of market shifts, there exists an -Nash equilibrium extending over a subset of connected local markets. We have provided the analysis for a network that is operated according to a game theoretic paradigm, so that its Nash equilibrium upholds the requirements of a second price auction, showing characteristics of efficiency, truthfulness and rationality with respect to certain system-wide criteria. We have focused on Nash equilibria whose uniqueness has been established, such as those for users with consistent bids [12]. We show that s| ∆ represents a continuous mapping [0, ∑ k∈λ j D k ] i∈Λ j onto itself, and that the continuous mapping of the convex compact set s * into itself (s * ) has at least one fixed point. We show that the symmetry built into strategy space provides built-in conditions for convergence and stability of a -Nash equilibrium over pairwise connected subsets ∆ * .
The dynamics of the system with the inclusion of brokers provides an interesting direction for future research. We speculate that certain network-wide objectives may be achieved (such as stability, bandwidth regulation, throttling) through the use of brokers. The brokers would exercise a type of feedback control, both a priori (in the static analysis) or in time, in order to maintain a desired network topology; one with a stable network-wide equilibrium. Here, we have examined the relation between two connected auction subsets under allocation constraints. We expect that with the addition of more players the strategy space will begin to suffer "the curse of dimensionality", rendering the analytic techniques we have used here (based on order and continuity) ineffective.
We would like to begin real-world simulations of the results presented in this paper, and extend our theory to include some practical, statistical analysis. In particular, we would like to add queueing theory and an underlying Poisson arrival process or Brownian motion [12], in order to add practical structure and timing to our game. This practical experience may give us insight as to the breadth and variation of the game according to the user strategy of truthfulness. An alternative method to determining Nash equilibria in the higher-dimensional strategy space (with more users) could be found, and the nature of the space could be described using simulated results.

Conflicts of Interest:
The authors declare no conflict of interest.

Abbreviations
The following abbreviations are used in this manuscript:

ISP
Internet Service Provider PSP Progressive Second Price VCG Vickrey-Clarke-Groves auction