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

Opción 1: Descargar recurso

Opción 2: Descargar recurso

Detalles del recurso


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.

Pertenece a

ETD at Indian Institute of Science  


Prakash, Gujar Sujit - 

Id.: 55211345

Idioma: inglés (Estados Unidos)  - 

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. 9 Stochastic Simulator for Optimal Cloud Resource Allocation in a Heterogeneous Environment Cloud computing environment provides on-demand access to shared resources that can be managed with m...
  2. Fixed Channel Allocation in Wireless Mesh Network Subject to Efficient Spectrum Usage and Reliability Constraint Reliability is one of the major issues with wireless networks. Failure in multiple radio channels of...
  3. Learning of resource allocation strategies for game playing Human chess players exhibit a large variation in the amount of time they allocate for each move. Yet...
  4. IPv4 address allocation and the BGP routing table evolution The IP address consumption and the global routing table size are two of the vital parameters of the ...
  5. Abstract Quality and Speed in Linear-scan Register Allocation A linear-scan algorithm directs the global allocation of reg-ister candidates to registers based on ...

Otros recursos de la misma colección

  1. Weighted Average Based Clock Synchronization Protocols For Wireless Sensor Networks Wireless Sensor Networks (WSNs) consist of a large number of resource constrained sensor nodes equip...
  2. Mechanism Design For Strategic Crowdsourcing This thesis looks into the economics of crowdsourcing using game theoretic modeling. The art of aggr...
  3. Studies In Automatic Management Of Storage Systems Autonomic management is important in storage systems and the space of autonomics in storage systems ...
  4. 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...
  5. 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...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.