Mechanisms for Dynamic Setting with Restricted Allocations
| dc.contributor.author | Yu, Yuxin | |
| dc.date.accessioned | 2011-10-27T14:26:50Z | |
| dc.date.available | 2011-10-27T14:26:50Z | |
| dc.date.issued | 2011-10-27T14:26:50Z | |
| dc.date.submitted | 2011-10-21 | |
| dc.description.abstract | Dynamic mechanism design is an important area of multiagent systems, and commonly used in resource allocation where the resources are time related or the agents exist dynamically. We focus on a multiagent model within which the agents stay, and the resources arrive and depart. The resources are interpreted as work or jobs and are called tasks. The allocation outcome space has a special restriction that every agent can only work on one resource at a time, because every agent has a finite computational capability in reality. We propose a dynamic mechanism and analyze its incentive properties; we show that the mechanism is incentive compatible. Empirically, our dynamic mechanism performs well and is able to achieve high economic efficiency, even outperforming standard approaches if the agents are concerned about future tasks. We also introduce a static mechanism under the setting of a restricted outcome space; it is proved that the static mechanism is incentive compatible, and its computational complexity is much less than that of the standard VCG mechanism. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/6366 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.subject | Mechanism | en |
| dc.subject | dynamic | en |
| dc.subject.program | Computer Science | en |
| dc.title | Mechanisms for Dynamic Setting with Restricted Allocations | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | School of Computer Science | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |