Yuzo Fujishima

Learn More
In combinatorial auctions, multiple goods are sold simultaneously and bidders may bid for arbitrary combinations of goods. Determining the outcome of such an auction is an optimization problem that is NP-complete in the general case. We propose two methods of overcoming this apparent intractability. The first method, which is guaranteed to be optimal,(More)
In recent years auctions have grown in interest w i th in the AI community as innovative mechanisms for resource allocation. The pr i mary contr ibut ion of this paper is to ident i fy a family of hybrid auctions, called survival auctions, which combine the benefits of both sealed-bid auctions (namely, quick and predictable terminat ion t ime) and(More)
In combinatorial auctions, multiple goods are sold simultaneously and bidders may bid for arbitrary combinations of goods. Determining the outcome of such an auction is an optimization problem that is NP-complete in the general case. We propose two methods of overcoming this apparent intractability. The first method, which is guaranteed to be optimal,(More)
ABSTRACT We present a programming by demonstration (PBD) system for text editing tasks and describe over an experimental evaluation of it. Unlike other PBD systems, our system can automate tasks that involve multiple focus points and conversions. In the system, a document is regarded as a sequence of objects and a task is modeled as repetitions of turns, in(More)
To assist an application software user in nonroutine tasks, a method named GIO was devised. By the method, the user can automatically achieve again a goal that was once achieved. The goal is represented in terms of input to and output from the application. The pieces of input that are collectively sufficient to achieve the goal are extracted from a record(More)
  • 1