Thursday, November 26, 2015



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



Otros recursos que te pueden interesar

  1. Handover Analysis in WIMAX using NPS and RCS WiMAX can provide at home or mobile internet access across whole cities or countries. It provides en...
  2. Review on Scheduling of Resources in Cloud Environment Cloud computing provides an environment, where a large pool of systems are connected in networks (i....
  3. Cost Optimization of Distributed Computing System with Dynamic Re-Allocation A Distributed Computing System (DCS) is a combination of application and system programs that exchan...
  4. Efficient Load Balancing Schema using Multiple Mobile Sink Ensuring efficient and fast data aggregation technique is one of the challenging task when it is con...
  5. Double Combinatorial Auction based Resource Allocation in Cloud Computing by Combinational using of ICA and Genetic Algorithms Computational resources have become cheaper, more powerful and accessible than ever with the develop...

Otros recursos de la misma colección

  1. Studies In Automatic Management Of Storage Systems Autonomic management is important in storage systems and the space of autonomics in storage systems ...
  2. Power Efficient Last Level Cache For Chip Multiprocessors The number of processor cores and on-chip cache size has been increasing on chip multiprocessors (CM...
  3. Learning Robust Support Vector Machine Classifiers With Uncertain Observations The central theme of the thesis is to study linear and non linear SVM formulations in the presence o...
  4. Sentiment-Driven Topic Analysis Of Song Lyrics Sentiment Analysis is an area of Computer Science that deals with the impact a document makes on a u...
  5. New Approaches And Experimental Studies On - Alegebraic Attacks On Stream Ciphers Algebraic attacks constitute an effective class of cryptanalytic attacks which have come up recently...

Valoración de los usuarios

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

Busque un recurso