Skip to main content

Bilateral trade

Supervisor

Suitable for

MSc in Computer Science
Computer Science, Part B
Mathematics and Computer Science, Part C
Computer Science and Philosophy, Part C
Computer Science, Part C

Abstract

One of the fundamental problems at the interface of Algorithms and Economics is the problem of designing algorithms for simple trade problems that are incentive compatible. An algorithm is incentive compatible when the participants have no reason to lie or deviate from the protocol. In general, we have a good understanding when the problem involves only buyers or only sellers, but poor understanding when the market has both buyers and sellers. This project will investigate and implement optimal algorithms for this problem. It will also consider algorithms that are natural and simple but may be suboptimal.

Prerequisites: Mathematical and algorithmic maturity. Fundamentals of game theory is useful, but not essential