Show simple item record

dc.contributor.authorKarande, Chinmayen_US
dc.date.accessioned2011-03-04T20:59:06Z
dc.date.available2011-03-04T20:59:06Z
dc.date.issued2010-09-17en_US
dc.identifier.urihttp://hdl.handle.net/1853/37229
dc.description.abstractA 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.publisherGeorgia Institute of Technologyen_US
dc.subjectMulti-agent systemsen_US
dc.subjectOnline auctionen_US
dc.subjectAlgorithmsen_US
dc.subjectMechanism designen_US
dc.subject.lcshSubmodular functions
dc.subject.lcshMatroids
dc.titleAlgorithms and mechanism design for multi-agent systemsen_US
dc.typeDissertationen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentComputingen_US
dc.description.advisorCommittee Chair: Vazirani, Vijay; Committee Member: Balcan, Maria-Florina; Committee Member: Cook, William; Committee Member: Thomas, Robin; Committee Member: Vigoda, Ericen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record