Resource Allocation in Decentralized Systems with Strategic Agents (eBook)

An Implementation Theory Approach

(Autor)

eBook Download: PDF
2013 | 2013
XVII, 88 Seiten
Springer New York (Verlag)
978-1-4614-6319-1 (ISBN)

Lese- und Medienproben

Resource Allocation in Decentralized Systems with Strategic Agents -  Ali Kakhbod
Systemvoraussetzungen
96,29 inkl. MwSt
  • Download sofort lieferbar
  • Zahlungsarten anzeigen
This thesis presents a significant contribution to decentralized resource allocation problems with strategic agents. The study focused on three classes of problems arising in communication networks. (C1). Unicast service provisioning in wired networks. (C2). Multi-rate multicast service provisioning in wired networks. (C3). Power allocation and spectrum sharing in multi-user multi-channel wireless communication systems.  Problems in (C1) are market problems; problems in (C2) are a combination of markets and public goods; problems in (C3) are public goods. Dr. Kakhbod developed game forms/mechanisms for unicast and multi-rate multicast service provisioning that possess specific properties. First, the allocations corresponding to all Nash equilibria (NE) of the games induced by the mechanisms are optimal solutions of the corresponding centralized allocation problems, where the objective is the maximization of the sum of the agents'  utilities.  Second, the strategic agents voluntarily participate in the allocation process.  Third, the budget is balanced at the allocations corresponding to all NE of the game induced by the mechanism as well as at all other feasible allocations. For the power allocation and spectrum sharing problem, he developed a game form that possesses the second and third properties as detailed above along with a fourth property: the allocations corresponding to all NE of the game induced by the mechanism are Pareto optimal. The thesis contributes to the state of the art of mechanism design theory. In particular, designing efficient mechanisms for the class of problems that are a combination of markets and public goods, for the first time, have been addressed in this thesis.  The exposition, although highly rigorous and technical, is elegant and insightful which makes this thesis work easily accessible to those just entering this field and will also be much appreciated by experts in the field.

Ali Kakhbod completed his PhD at the University of Michigan.
This thesis presents a significant contribution to decentralized resource allocation problems with strategic agents. The study focused on three classes of problems arising in communication networks. (C1). Unicast service provisioning in wired networks. (C2). Multi-rate multicast service provisioning in wired networks. (C3). Power allocation and spectrum sharing in multi-user multi-channel wireless communication systems. Problems in (C1) are market problems; problems in (C2) are a combination of markets and public goods; problems in (C3) are public goods. Dr. Kakhbod developed game forms/mechanisms for unicast and multi-rate multicast service provisioning that possess specific properties. First, the allocations corresponding to all Nash equilibria (NE) of the games induced by the mechanisms are optimal solutions of the corresponding centralized allocation problems, where the objective is the maximization of the sum of the agents' utilities. Second, the strategic agents voluntarily participate in the allocation process. Third, the budget is balanced at the allocations corresponding to all NE of the game induced by the mechanism as well as at all other feasible allocations. For the power allocation and spectrum sharing problem, he developed a game form that possesses the second and third properties as detailed above along with a fourth property: the allocations corresponding to all NE of the game induced by the mechanism are Pareto optimal. The thesis contributes to the state of the art of mechanism design theory. In particular, designing efficient mechanisms for the class of problems that are a combination of markets and public goods, for the first time, have been addressed in this thesis. The exposition, although highly rigorous and technical, is elegant and insightful which makes this thesis work easily accessible to those just entering this field and will also be much appreciated by experts in the field.

Ali Kakhbod completed his PhD at the University of Michigan.

Introduction.- Motivation.- Key issues and challenges in resource allocation.- Contribution of the thesis.- Organization of the thesis.- What is Implementation Theory?.- Preliminaries.- Game Forms/Mechanisms.- Implementation in an appropriate equilibrium concept.- Implementation in Nash Equilibrium and Maskin's Mechanism.- Interpreting Nash Equilibrium.- Desirable Properties of Game Forms.- Contribution of the chapter.- Comparison with related work.- Organization of the chapter.- The unicast problem with strategic network users, Problem Formulation.- The centralized problem.- The decentralized problem with strategic users.- A Mechanism for Rate Allocation.- Specification of the mechanism.- Discussion/Interpretation of the Mechanism.- Properties of the Mechanism.- Implementation of the decentralized mechanism.- An Extension.- Introduction.- Contribution of the Chapter.- Comparison with related work.- Organization of the chapter.- The Model and Objective.- The Model.- Objective.- A Mechanism for Power Allocation and Spectrum Sharing.- Interpretation of the Mechanism.- Properties of The Mechanism.- Introduction.- Motivation and Challenges.- Why is strategic behavior justied?.- Contribution of the chapter.- Comparison with related work.- Organization of the chapter.- The multi-rate multicast problem with strategic network users, Problem Formulation.- The centralized problem.- The decentralized problem with strategic users.- Key features/natures of the problem.- A Mechanism for Rate Allocation.- Guidelines for the design of the mechanism.- Specification of the mechanism.- Discussion/Interpretation of the Mechanism.- Properties of the Mechanism.- Summary.- Future directions.- Algorithmic issues.- Dynamic environments.- Beyond quasi-linear forms.

Erscheint lt. Verlag 24.1.2013
Reihe/Serie Springer Theses
Zusatzinfo XVII, 88 p.
Verlagsort New York
Sprache englisch
Themenwelt Mathematik / Informatik Informatik Netzwerke
Informatik Weitere Themen Hardware
Recht / Steuern EU / Internationales Recht
Recht / Steuern Wirtschaftsrecht
Technik Elektrotechnik / Energietechnik
Technik Nachrichtentechnik
Wirtschaft Volkswirtschaftslehre
Schlagworte implementation theory • Markets • Mechanism Design • Multi-rate Multicast Service Provisioning • Nash Equilibrium • power allocation • Pricing Game Theory • public goods • Rate Allocation in Wired Networks • Spectrum Sharing in Wireless Networks • Unicast Service Provisioning
ISBN-10 1-4614-6319-X / 146146319X
ISBN-13 978-1-4614-6319-1 / 9781461463191
Haben Sie eine Frage zum Produkt?
PDFPDF (Wasserzeichen)
Größe: 1,3 MB

DRM: Digitales Wasserzeichen
Dieses eBook enthält ein digitales Wasser­zeichen und ist damit für Sie persona­lisiert. Bei einer missbräuch­lichen Weiter­gabe des eBooks an Dritte ist eine Rück­ver­folgung an die Quelle möglich.

Dateiformat: PDF (Portable Document Format)
Mit einem festen Seiten­layout eignet sich die PDF besonders für Fach­bücher mit Spalten, Tabellen und Abbild­ungen. Eine PDF kann auf fast allen Geräten ange­zeigt werden, ist aber für kleine Displays (Smart­phone, eReader) nur einge­schränkt geeignet.

Systemvoraussetzungen:
PC/Mac: Mit einem PC oder Mac können Sie dieses eBook lesen. Sie benötigen dafür einen PDF-Viewer - z.B. den Adobe Reader oder Adobe Digital Editions.
eReader: Dieses eBook kann mit (fast) allen eBook-Readern gelesen werden. Mit dem amazon-Kindle ist es aber nicht kompatibel.
Smartphone/Tablet: Egal ob Apple oder Android, dieses eBook können Sie lesen. Sie benötigen dafür einen PDF-Viewer - z.B. die kostenlose Adobe Digital Editions-App.

Buying eBooks from abroad
For tax law reasons we can sell eBooks just within Germany and Switzerland. Regrettably we cannot fulfill eBook-orders from other countries.

Mehr entdecken
aus dem Bereich