Jonathan S Levin

US Patent:

20100100422, Apr 22, 2010

Filed:

Oct 22, 2008

Appl. No.:

12/255896

Inventors:

Michael A. Schwarz - Berkeley CA, US
R. Preston McAfee - San Marino CA, US
Sai-Ming Li - Santa Clara CA, US
Jonathan D. Levin - Stanford CA, US

Assignee:

YAHOO! INC. - Sunnyvale CA

International Classification:

G06Q 90/00
G06Q 30/00
G06Q 20/00
G06F 17/30

US Classification:

705 10, 705400, 705 1453

Abstract:

Disclosed are apparatus and methods for pricing on-line advertisement inventory. In one embodiment, a method for pricing on-line advertisement inventory includes (i) forecasting a delivery cost for delivering a plurality of deliverable impressions to meet a guaranteed delivery contract for a particular advertising product; and (ii) determining a target price for a guaranteed delivery contract for such particular advertising product by adjusting the delivery cost based on one or more changes in one or more conditions of a supply and demand market.

US Patent:

20140337155, Nov 13, 2014

Filed:

May 10, 2013

Appl. No.:

13/892126

Inventors:

- Palo Alto CA, US
Ilya Segal - Stanford CA, US
Jonathan Levin - Stanford CA, US

Assignee:

Auctionomics, Inc - Palo Alto CA

International Classification:

G06Q 30/08

US Classification:

705 263

Abstract:

The present invention is directed to systems and methods for implementing heuristic-based auctions for complex resource allocations. The systems and methods include an auctioneer's system that uses a bid-entry device comprising a dedicated system for each bidder to collect bid information and a mechanism by which the auctioneer may communicate results or current prices to bidders in a dynamic process. The auctioneer's system may be coupled to a database that stores information about the items for sale including bid information. The auctioneer's system may be configured to query this database and receive answers with information required to determine allocations and prices. The auctioneer's system may also be coupled, via a communication link, to one or more feasibility-checker systems, comprising a parallel array of one or more computing systems that implements the feasibility-checking process at any given round in a dynamic implementation or any computational iteration in a sealed-bid implementation.