[E-Lang] Combination Auctions at Stanford Today!

[Mark S. Miller]

A bit off topic for this list, but several of us suspect that fancy auctions 
may be where we'll find the biggest killer apps for distributed capabilities 
and smart contracts.  I plan to attend.


Today at Stanford: 
http://robotics.stanford.edu/ba-colloquium/abstracts/abst-shoham.html


Some Interesting Problems at the Interface of Computer Science and Game Theory 

                                    Yoav Shoham
                       Department of Computer Science
                                 Stanford University

                          Monday, Nov 27, 2000, 4:15PM
                             TCseq200, Lecture Hall A
                    http://robotics.stanford.edu/ba-colloquium/

                                       Abstract

The problems that lie at this interface span a broad range. In this version 
of my generically titled talk I'll cover three pieces of work that we've 
been involved with in recent years. All three have to do with auctions, and 
they range from the immediately useful (but perhaps mundane) to the rather 
useless (but beautiful, imo). They are, in order: (1) Taming the 
computational complexity of combinatorial auctions (with Kevin Leyton-Brown, 
among others), (2) Trading off economic efficiency and computational 
efficiency (with Daniel Lehmann and Liadan O'Callahan), and (3) Rational 
computability (with Moshe Tennenholtz).


(Thanks to Markus Krummenaker and Ken Kahn for bringing this to my attention.)

        Cheers,
        --MarkM