Loading...
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 47518 (19)
- University: Sharif University of Technology
- Department: Computer Engineering
- Advisor(s): Ghodsi, Mohammad
- Abstract:
- The concept of Online-Distributed Mechanism Design, is taken from the two concepts of Online Mechanism and Distributed Mechanism and speaks of an environment which is dynamic when there is no trusted center to do the computation. This problem is stated in this thesis for the first time and by the thesis we gave the first results in some of the up coming fields of Online-Distributed Mechanism. These feilds would be defined by different assupmtions about dynamic environments and the way of distributing of computation among agents. We consider single valued preference domains in the absence of any trusted center and in the presence of an enforcer. Then we try to design truthful auctions for domains with expiring items when there is no trusted center. We also explored the problem of assigning multiple processors to dynamic agents which come over time. In general, we implemented an Incentive compatible mechanism M(x; p) in a single parameter platform in the following topologies: Complete graph, ring, and tree. Using redundancy we proved that M can be implemented in all three topologies and that these topologies are somehow the same, since an algorithm for an Online-Distributed computation in one, can be applied in another simply. Finally, we showed that using redundancy, one can give an awesome mechanism to the problems of Online-Distributed environment in single parameter setting
- Keywords:
- Mechanism Design ; Game Theory ; Algorithmic Game Theory ; Online Mechanisms ; Distributed Mechanisms ; Online-Distributed Mechanism Design
