# US 2017/0366681 A1 · Systems and methods for allocating and pricing alternative network access resources with reserve prices

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2017/0366681 A1
- Document ID: US20170366681A1
- Status: Published application
- Kind: A1
- Application number: 15/691,566
- Filed: 2017-08-30
- Published: 2017-12-21
- Earliest claimed: 2013-12-31
- Assignees: Bandwidthx Inc.
- Applicants: Bandwidthx Inc.
- Inventors: Sven SEUKEN; Pertti Juhani VISURI; Johanna Katariina VISURI; Dan ZAGURSKY
- Web page: https://patentgrep.com/patent/US20170366681A1

## CPC

- H04M 15/80: {Rating or billing plans; Tariff determination aspects}
- H04L 12/145: {trading network capacity or selecting route based on tariff}
- H04L 41/0896: Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities (flow or congestion control using dynamic resource allocation, e.g. in-call renegotiation, H04L47/76)
- H04M 15/49: {Connection to several service providers}
- H04M 15/785: {Reserving amount on the account}
- H04M 15/805: {Bidding}
- H04W 16/00: Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W 36/1446: {wherein at least one of the networks is unlicensed}
- H04W 36/22: for handling the traffic
- H04W 36/30: by measured or perceived connection quality data
- H04W 36/322: {by location data}
- H04M 15/50: {for cross-charging network operators}
- H04W 48/18: Selecting a network or a communication service
- H04W 76/16: Involving different core network technologies, e.g. a packet-switched [PS] bearer in combination with a circuit-switched [CS] bearer
- H04W 84/12: WLAN [Wireless Local Area Networks]
- H04W 88/06: adapted for operation in multiple networks {or having at least two operational modes}, e.g. multi-mode terminals
- H04M: TELEPHONIC COMMUNICATION (circuits for controlling other apparatus via a telephone cable and not involving telephone switching apparatus G08)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

A method for allocating and pricing access to alternative access networks may include: inputting, by one or more parties, needs for alternative network access and representative values for satisfying the needs; setting, by providers of alternative network access, reserve prices for access to each of access point in the alternative network; generating a solution based on a mixed integer program to maximize value created by allocation of alternative network access; and allocating alternative network access to the one or more parties based on the mixed integer program solution.

## Claims

### Claim 1

A method comprising, by at least one hardware processor:
receiving, from each of a plurality of parties, an offloading demand for future access to an alternative network;
receiving, from each of a plurality of providers of access to the alternative network, a reserve price for access to a plurality of access points in the alternative network that are provided by the provider;
for reservations within a short-term future time span, allocating and pricing reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving a mixed integer program using a Vickrey-Clarke-Groves (VCG) mechanism;
for reservations within a long-term future time span that is further in the future than the short-term future time span, allocating and pricing reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving a mixed integer program using core-selecting combinatorial auctions; and,
for each reservation, at the time of that reservation, offloading one or more mobile devices, that are communicatively connected to a primary network of the party to which that reservation was allocated, from the primary network to the reserved access point of the alternative network.

### Claim 2 (depends on 1)

The method of claim 1, wherein allocating and pricing reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving the mixed integer program using the VCG mechanism comprises:
computing a first solution to the mixed integer program for all of the plurality of parties;
for each winning party in the solution, allocating a reservation won by that winning party to that winning party, and computing a second solution to the mixed integer program for all of the plurality of parties except that winning party; and
calculating a price, to each winning party for each reservation won by that winning party, as a difference between a value of the second solution, which excludes that winning party, to all of the plurality of parties except that winning party and a value of the first solution to all of the plurality of parties except that winning party.

### Claim 3 (depends on 2)

The method of claim 2, wherein allocating and pricing reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving a mixed integer program using core-selecting combinatorial auctions comprises executing a price-finding algorithm that minimizes a Euclidean distance between a core payment vector and a VCG payment vector, wherein the core payment vector comprises a set of prices for winning parties, such that no losing party would be willing to pay more for a reservation than what a winning party would pay, and wherein the VCG payment vector comprises the prices for each winning party calculated using the VCG mechanism.

### Claim 4 (depends on 3)

The method of claim 3, wherein allocating and pricing reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving a mixed integer program using core-selecting combinatorial auctions further comprises iteratively adding new core constraints to the price-finding algorithm until no core constraints are violated.

### Claim 5 (depends on 1)

The method of claim 1, wherein the short-term future time span is one day long.

### Claim 6 (depends on 1)

The method of claim 1, wherein the reserve price, received from each of the plurality of providers, is a minimum price that must be met on average across all of the plurality of access points in the alternative network that are provided by that provider.

### Claim 7 (depends on 1)

The method of claim 1, wherein, from each of the plurality of providers, a reserve price is received for each of the plurality of access points in the alternative network that are provided by that provider.

### Claim 8 (depends on 1)

The method of claim 1, wherein the primary network is a wireless cellular network, and

### Claim 9 (depends on 8)

The method of claim 8, wherein the alternative access network is a Wi-Fi network.

### Claim 10 (depends on 8)

The method of claim 8, wherein each offloading demand indicates a cellular sector and a time slot, and wherein each reservation is for an access point within the cellular sector and during the time slot included in at least one offloading demand.

### Claim 11 (depends on 10)

The method of claim 10, wherein the plurality of parties comprise one or more of a mobile network operator and a mobile virtual network operator

### Claim 12 (depends on 11)

The method of claim 11, wherein the mixed integer program for the reservations in one or both of the short-term future time span and the long-term future time span comprises:
max

∑
i
∈
I

∑
j
∈
J

V
ij
·
∑
k
∈
K

y
ijk
D
ij
+
∑
i
∈
I
′

∑
j
∈
J

∑
k
∈
K

V
i
′
·
Y
ijk
wherein i ε I represents a set that includes each mobile network operator,
wherein i ε I′ represents a set that includes each mobile virtual network operator,
wherein j ε J represents a set that includes each cellular sector,
wherein k ε K represents a set that includes each time slot,
wherein Vij represents a value to a mobile network operator i for offloading all demand in a cellular sector j to the alternative network,
wherein V′i represents a per-unit value to a mobile virtual network operator i for offloading data to the alternative network,
wherein Yijk represents a reservation to a mobile network operator i or mobile virtual network operator i for a sector j during time slot k, and
wherein Dij represents an offloading demand from a mobile network operator i in a cellular sector.

### Claim 13

A system comprising:
at least one hardware processor; and
one or more software modules that, when executed by the at least one hardware processor,
receive, from each of a plurality of parties, an offloading demand for future access to an alternative network,
receive, from each of a plurality of providers of access to the alternative network, a reserve price for access to a plurality of access points in the alternative network that are provided by the provider,
for reservations within a short-term future time span, allocate and price reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving a mixed integer program using a Vickrey-Clarke-Groves (VCG) mechanism,
for reservations within a long-term future time span that is further in the future than the short-term future time span, allocate and price reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving a mixed integer program using core-selecting combinatorial auctions, and,
for each reservation, at the time of that reservation, offload one or more mobile devices, that are communicatively connected to a primary network of the party to which that reservation was allocated, from the primary network to the reserved access point of the alternative network.

### Claim 14 (depends on 13)

The system of claim 13, wherein allocating and pricing reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving the mixed integer program using the VCG mechanism comprises:
computing a first solution to the mixed integer program for all of the plurality of parties;
for each winning party in the solution, allocating a reservation won by that winning party to that winning party, and computing a second solution to the mixed integer program for all of the plurality of parties except that winning party; and
calculating a price, to each winning party for each reservation won by that winning party, as a difference between a value of the second solution, which excludes that winning party, to all of the plurality of parties except that winning party and a value of the first solution to all of the plurality of parties except that winning party.

### Claim 15 (depends on 14)

The system of claim 14, wherein allocating and pricing reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving a mixed integer program using core-selecting combinatorial auctions comprises executing a price-finding algorithm that minimizes a Euclidean distance between a core payment vector and a VCG payment vector, wherein the core payment vector comprises a set of prices for winning parties, such that no losing party would be willing to pay more for a reservation than what a winning party would pay, and wherein the VCG payment vector comprises the prices for each winning party calculated using the VCG mechanism.

### Claim 16 (depends on 15)

The system of claim 15, wherein allocating and pricing reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving a mixed integer program using core-selecting combinatorial auctions further comprises iteratively adding new core constraints to the price-finding algorithm until no core constraints are violated.

### Claim 17

A non-transitory computer-readable medium storing instructions that, when executed by a processor, cause the processor to:
receive, from each of a plurality of parties, an offloading demand for future access to an alternative network;
receive, from each of a plurality of providers of access to the alternative network, a reserve price for access to a plurality of access points in the alternative network that are provided by the provider;
for reservations within a short-term future time span, allocate and price reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving a mixed integer program using a Vickrey-Clarke-Groves (VCG) mechanism;
for reservations within a long-term future time span that is further in the future than the short-term future time span, allocate and price reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving a mixed integer program using core-selecting combinatorial auctions; and,
for each reservation, at the time of that reservation, offload one or more mobile devices, that are communicatively connected to a primary network of the party to which that reservation was allocated, from the primary network to the reserved access point of the alternative network.

### Claim 18 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein allocating and pricing reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving the mixed integer program using the VCG mechanism comprises:
computing a first solution to the mixed integer program for all of the plurality of parties;
for each winning party in the solution, allocating a reservation won by that winning party to that winning party, and computing a second solution to the mixed integer program for all of the plurality of parties except that winning party; and
calculating a price, to each winning party for each reservation won by that winning party, as a difference between a value of the second solution, which excludes that winning party, to all of the plurality of parties except that winning party and a value of the first solution to all of the plurality of parties except that winning party.

### Claim 19 (depends on 18)

The non-transitory computer-readable medium of claim 18, wherein allocating and pricing reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving a mixed integer program using core-selecting combinatorial auctions comprises executing a price-finding algorithm that minimizes a Euclidean distance between a core payment vector and a VCG payment vector, wherein the core payment vector comprises a set of prices for winning parties, such that no losing party would be willing to pay more for a reservation than what a winning party would pay, and wherein the VCG payment vector comprises the prices for each winning party calculated using the VCG mechanism.

### Claim 20 (depends on 19)

The non-transitory computer-readable medium of claim 19, wherein allocating and pricing reservations of the plurality of access points, provided by the plurality of providers, to the plurality of parties by solving a mixed integer program using core-selecting combinatorial auctions further comprises iteratively adding new core constraints to the price-finding algorithm until no core constraints are violated.
