NDLI: Brief announcement: universally truthful secondary spectrum auctions

Please wait, while we are loading the content...

Fast greedy algorithms in mapreduce and streaming

Storage and search in dynamic peer-to-peer networks

Brief announcement: truly parallel burrows-wheeler compression and decompression

IRIS: a robust information system against insider dos-attacks

Coalescing-branching random walks on graphs

Work-efficient matrix inversion in polylogarithmic time

Profitable scheduling on multiple speed-scalable processors

Cloud scheduling with setup cost

Reduced hardware transactions: a new approach to hybrid transactional memory

Broadcasting in logarithmic time for ad hoc network nodes on a line using mimo

Brief announcement: locality in wireless scheduling

SybilCast: broadcast on the open airwaves (extended abstract)

Parallel rotor walks on finite graphs and applications in discrete load balancing

Communication optimal parallel multiplication of sparse random matrices

Nonclairvoyant sleep management and flow-time scheduling on multiple processors

Efficient online scheduling for deadline-sensitive jobs: extended abstract

Recursive design of hardware priority queues

Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract

Brief announcement: universally truthful secondary spectrum auctions

On-the-fly pipeline parallelism

Parallel graph decompositions using random shifts

Communication efficient gaussian elimination with partial pivoting using a shape morphing data layout

Reallocation problems in scheduling

Locality-aware task management for unstructured parallelism: a quantitative limit study

Drop the anchor: lightweight memory management for non-blocking data structures

On dynamics in selfish network creation

Brief announcement: online batch scheduling for flow objectives

Reducing contention through priority updates

A constant factor approximation algorithm for the storage allocation problem: extended abstract

Optimal patrolling of fragmented boundaries

Efficient scheduling to minimize calibrations

Balls-into-bins with nearly optimal load distribution

Scalable statistics counters

Brief announcement: set it and forget it - approximating the set once strip cover problem

HEX: scaling honeycombs is easier than scaling clock trees

Non-monetary fair scheduling: a cooperative game theory approach

Brief announcement: between all and nothing - versatile aborts in hardware transactional memory

Brief announcement: towards a fully-articulated pessimistic distributed transactional memory

Brief announcement: a game-theoretic model motivated by the darpa network challenge

Brief announcement: universally truthful secondary spectrum auctions

Content Provider	ACM Digital Library
Author	Hoefer, Martin Kesselheim, Thomas
Abstract	We present algorithms for implementing local spectrum redistribution in wireless networks using a mechanism design approach. For example, in single-hop request scheduling, secondary users are modeled as rational agents that have private utility when getting assigned a channel for successful transmission. We present a simple algorithmic technique that allows to turn existing and future approximation algorithms and heuristics into truthful mechanisms for a large variety of networking problems. Our approach works with virtually all known interference models in the literature, including the physical model of interference based on SINR. It allows to address single-hop and multi-hop scheduling, routing, and even more general assignment and allocation problems. Our mechanisms are randomized and represent the first universally-truthful mechanisms for these problems with rigorous worst-case guarantees on the solution quality. In this way, our mechanisms can be used to obtain guaranteed solution quality even with risk-averse or risk-seeking bidders, for which existing approaches fail.
Starting Page	99
Ending Page	101
Page Count	3
File Format	PDF
ISBN	9781450315722
DOI	10.1145/2486159.2486163
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-07-23
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Sinr model Mechanism design Secondary usage Universal truthfulness
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Universally truthful secondary spectrum auctions

Brief announcement: distributed algorithmic mechanism design for scheduling

Universally Truthful Secondary Spectrum Auctions

An approximate truthfulness motivated spectrum auction for dynamic spectrum access.

Revenue generation for truthful spectrum auction in dynamic spectrum access

Truthful assignment without money

Approximation algorithms for secondary spectrum auctions

Brief Announcement: Multi-Broadcasting under the SINR Model

A universally-truthful approximation scheme for multi-unit auctions (2012).

Brief announcement: universally truthful secondary spectrum auctions

Similar Documents

Universally truthful secondary spectrum auctions

Brief announcement: distributed algorithmic mechanism design for scheduling

Universally Truthful Secondary Spectrum Auctions

An approximate truthfulness motivated spectrum auction for dynamic spectrum access.

Revenue generation for truthful spectrum auction in dynamic spectrum access

Truthful assignment without money

Approximation algorithms for secondary spectrum auctions

Brief Announcement: Multi-Broadcasting under the SINR Model

A universally-truthful approximation scheme for multi-unit auctions (2012).

Brief announcement: universally truthful secondary spectrum auctions