Monday, July 28, 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. Joint measurement- and traffic descriptor-based admission control at real-time traffic aggregation points The primary role of admission control is to decide on the amount of traffic accepted into the networ...
  2. Decomposition of Parallel Copies with Duplication SSA form is becoming more popular in the context of JIT compilation since it allows the compiler to ...
  3. Bayesian methods for the design and interpretation of clinical trials in very rare diseases. This paper considers the design and interpretation of clinical trials comparing treatments for condi...
  4. Preventing the development of dogmatic approaches in conservation biology: A review The application of management practices based on dogmas may lead to unexpected results, and hence to...
  5. Physiological basis and ecological significance of the seed size and relative growth rate relationship in Mediterranean annuals 1. During the first three weeks of growth with plentiful water and mineral nutrients 27 Mediterranea...

Otros recursos de la misma colección

  1. An Algorithmic Characterization Of Polynomial Functions Over Zpn The problem of polynomial representability of functions is central to many branches of mathematics. ...
  2. Reliability Modelling Of Whole RAID Storage Subsystems Reliability modelling of RAID storage systems with its various components such as RAID controllers, ...
  3. Design Of Truthful Allocation Mechanisms For Carbon Footprint Reduction Global warming is currently a major challenge faced by the world. Reduction of carbon emissions is ...
  4. Boxicity And Cubicity : A Study On Special Classes Of Graphs Let F be a family of sets. A graph G is an intersection graph of sets from the family F if there exi...
  5. Scaling Context-Sensitive Points-To Analysis Pointer analysis is one of the key static analyses during compilation. The efficiency of several com...

Valoración de los usuarios

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

Busque un recurso