Thursday, December 18, 2014

 

 



Soy un nuevo usuario

Olvidé mi contraseña

Entrada usuarios

Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida
Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía
Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía
Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía


Novel Mechanisms For Allocation Of Heterogeneous Items In Strategic Settings

1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario
    registrado en Universia


  Descargar recurso   Descargar recurso

Detalles del recurso

Pertenece a: ETD at Indian Institute of Science  

Descripción: Allocation of objects or resources to competing agents is a ubiquitous problem in the real world. For example, a federal government may wish to allocate different types of spectrum licenses to telecom service providers; a search engine has to assign different sponsored slots to the ads of advertisers; etc. The agents involved in such situations have private preferences over the allocations. The agents, being strategic, may manipulate the allocation procedure to get a favourable allocation. If the objects to be allocated are heterogeneous (rather than homogeneous), the problem becomes quite complex. The allocation problem becomes even more formidable in the presence of a dynamic supply and/or demand. This doctoral work is motivated by such problems involving strategic agents, heterogeneous objects, and dynamic supply and/or demand. In this thesis, we model such problems in a standard game theoretic setting and use mechanism design to propose novel solutions to the problems. We extend the current state-of-the-art in a non-trivial way by solving the following problems: Optimal combinatorial auctions with single minded bidders, generalizing the existing methods to take into account multiple units of heterogeneous objects Multi-armed bandit mechanisms for sponsored search auctions with multiple slots, generalizing the current methods that only consider a single slot. Strategyproof redistribution mechanisms for heterogeneous objects, expanding the scope of the current state of practice beyond homogeneous objects Online allocation mechanisms without money for one-sided and two-sided matching markets, extending the existing methods for static settings.

Autor(es): Prakash, Gujar Sujit - 

Id.: 55211345

Idioma: English (United States)  - 

Versión: 1.0

Estado: Final

Palabras claveInvestments (Economics) -  Allocation - 

Tipo de recurso: Thesis  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

Requerimientos técnicos:  Browser: Any - 

Relación: [References] G24693

Fecha de contribución: 21-abr-2012

Contacto:

Localización:


Otros recursos que te pueden interesar

  1. M.: Revisiting Randomized Parallel Load Balancing Algorithms We deal with the well studied allocation problem of assigning n balls to n bins so that the max-imum...
  2. Restructuring Facility Networks under Economy of Scales∗ In this work we address the facility network restructuring problem. This problem is closely related ...
  3. Join Algorithm Costs Revisited . A method of analysing join algorithms based upon the time required to access, transfer and perform...
  4. Cache Performance of Fast-Allocating Programs We study the cache performance of a set of ML programs, compiled by the Standard ML of New Jersey co...
  5. Registers On Demand: Integrated register allocation and instruction scheduling Two of the most important phases of code generation for instruction level parallel processors are re...

Otros recursos de la misma colección

  1. Visual Analysis Of Interactions In Multifield Scientific Data Data from present day scientific simulations and observations of physical processes often consist of...
  2. Rainbow Connection Number Of Graph Power And Graph Products The minimum number of colors required to color the edges of a graph so that any two distinct vertice...
  3. A Novel Game Theoretic And Voting Mechanism Based Approach For Carbon Emissions Reduction Global warming is currently a major challenge facing the world. There are widespread ongoing efforts...
  4. Autonomous Spacecraft Mission Planning And Execution In A Petri Net Framework Presently, most spacecraft are controlled from ground involving activities such as up-linking the sc...
  5. Two Player Game Variant Of The Erdos Szekeres Problem The following problem has been known for its beauty and elementary character. The Erd˝os Szekeres pr...

Valoración de los usuarios

No hay ninguna valoración para este recurso.Sea el primero en valorar este recurso.
 

Busque un recurso