Algorithmic Game Theory
Algorithmic game theory is a rapidly growing field that studies algorithmic problems in environments involving parties that each have their own self-interest in the outcome (e.g. Internet or commerce applications). Among its sub-fields are the design of complex auctions and resource allocation mechanisms, analysis of strategic environments using approximation techniques, analysis of prediction markets, and more. Algorithmic game theory has the potential of being highly valuable to IBM in particular in the context of smarter planet applications.
Contact: Amir Ronen (amirro@il.ibm.com)
>> Back to Machine Learning and Constraint Satisfaction page