Algorithms and mechanism design for multi-agent systems

Show simple item record Karande, Chinmay en_US 2011-03-04T20:59:06Z 2011-03-04T20:59:06Z 2010-09-17 en_US
dc.description.abstract A scenario where multiple entities interact with a common environment to achieve individual and common goals either co-operatively or competitively can be classified as a Multi-Agent System. In this thesis, we concentrate on the situations where the agents exhibit selfish, competitive and strategic behaviour, giving rise to interesting game theoretic and optimization problems. From a computational point of view, the presence of multiple agents introduces strategic and temporal issues, apart from enhancing the difficulty of optimization. We study the following natural mathematical models of such multi-agent problems faced in practice: a) combinatorial optimization problems with multi-agent submodular cost functions, b) combinatorial auctions with partially public valuations and c) online vertex-weighted bipartite matching and single bid budgeted allocations. We provide approximation algorithms, online algorithms and hardness of approximation results for these problems. en_US
dc.publisher Georgia Institute of Technology en_US
dc.subject Multi-agent systems en_US
dc.subject Online auction en_US
dc.subject Algorithms en_US
dc.subject Mechanism design en_US
dc.subject.lcsh Submodular functions
dc.subject.lcsh Matroids
dc.title Algorithms and mechanism design for multi-agent systems en_US
dc.type Dissertation en_US Ph.D. en_US
dc.contributor.department Computing en_US
dc.description.advisor Committee Chair: Vazirani, Vijay; Committee Member: Balcan, Maria-Florina; Committee Member: Cook, William; Committee Member: Thomas, Robin; Committee Member: Vigoda, Eric en_US

Files in this item

Files Size Format View
karande_chinmay_d_201012_phd.pdf 898.8Kb PDF View/ Open

This item appears in the following Collection(s)

Show simple item record