Jonathan B Feldman

US Patent:

20170330243, Nov 16, 2017

Filed:

Mar 17, 2014

Appl. No.:

14/215824

Inventors:

- Mountain View CA, US
David Vespe - New York NY, US
Jonathan Ezra Feldman - New York NY, US

Assignee:

Google Inc. - Mountain View CA

International Classification:

G06Q 30/02

Abstract:

Systems, methods, and computer-readable storage media that may be used to provide bid adjustment recommendations for budget-constrained content campaigns are provided. One method includes identifying a content campaign eligible for each of a plurality of auctions that was excluded from at least some of the auctions based on a budget constraint. The method further includes simulating the auctions using one or more adjusted bid values and generating estimated results for the adjusted bid values based on the simulated auctions. The method further includes determining at least one adjusted bid value that is estimated to result in at least one of the following: (1) increased clicks under substantially the same budget constraint; (2) increased clicks at substantially the same total cost; or (3) decreased cost with substantially the same number of clicks. The method further includes providing at least one recommendation to adopt the at least one adjusted bid value.

US Patent:

20150220530, Aug 6, 2015

Filed:

May 15, 2014

Appl. No.:

14/278811

Inventors:

- Mountain View CA, US
Silvio Lattanzi - New York NY, US
Jonathan Ezra Feldman - New York NY, US
Alessandro Epasto - Rome, IT
Stefano Leonardi - Rome, IT
Hugh Lynch - Rocky Hill NJ, US
Varun Sharma - Jersey City NJ, US

Assignee:

GOOGLE INC. - Mountain View CA

International Classification:

G06F 17/30

Abstract:

Systems and methods offer an efficient approach to computing similarity rankings in bipartite graphs. An example system includes at least one processor and memory storing a bipartite graph having a first set and a second set of nodes, with nodes in the first set being connected to nodes in the second set by edges. The memory also stores instructions that, when executed by the at least one processor, cause the system to assign each node in the second set to one of a plurality of categories and, for each of the plurality of categories, generate a subgraph. The subgraph comprises of a subset of nodes in the first set and edges linking the nodes in the subset, where the nodes in the subset are selected based on connection to a node in the second set that is assigned to the category. The system uses the subgraph to respond to queries.

US Patent:

20150193815, Jul 9, 2015

Filed:

Aug 7, 2012

Appl. No.:

13/569112

Inventors:

Adam Isaac Juda - New York NY, US
Jonathan Feldman - New York NY, US
David Vespe - New York NY, US

International Classification:

G06Q 30/02

Abstract:

Experiment performance data associated with a first advertisement campaign is generated during a first advertisement campaign experiment. The experiment performance data includes a first set of experiment performance data and a second set of experiment performance data. A first set of simulated performance data for the first advertisement campaign using first set of auction instances with the advertisement campaign setting having second advertisement campaign value is generated. A second set of simulated performance data for the first advertisement campaign using the second set of auctions instances with the advertisement campaign setting having the first advertisement campaign value is generated. Accuracy of the first set of performance data and the second set of performance data is determined by comparing the first performance data to the second set of experiment performance data, and by comparing the second performance data to the first set of experiment performance data.

US Patent:

20140180800, Jun 26, 2014

Filed:

Feb 26, 2014

Appl. No.:

14/190317

Inventors:

- Mountain View CA, US
Jonathan E. Feldman - New York NY, US
Seyed Vahab Mirrokni Banadaki - New York NY, US

Assignee:

Google Inc. - Mountain View CA

International Classification:

G06Q 30/02

US Classification:

705 1446

Abstract:

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for content distribution. In one aspect, a method includes obtaining reservation data specifying a reservation period and a number of impression reservations for the reservation period; receiving, during the reservation period, content item request data specifying that a resource was requested; identifying candidate content item providers; determining an expected revenue that will be obtained by selecting one of the candidate content item providers to provide a content item; providing, to a content item exchange, auction data including a reserve price; receiving positive response data specifying that the content item exchange will provide an exchange content item for a price that meets the reserve price; and in response to receiving the positive response data, selecting the exchange content item as the content item to be provided in response to receiving the content item request data.