EasyBid: Enabling Cellular Offloading via Small Players Zhixue Lu 1, Prasun Sinha 1 and R. Srikant 2 1 The Ohio State University 2 Univ. of Illinois at.

Slides:



Advertisements
Similar presentations
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 17 Auction-based.
Advertisements

February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
6.896: Topics in Algorithmic Game Theory Lecture 21 Yang Cai.
High Speed Networks Budapest University of Technology and Economics High Speed Networks Laboratory General Distributed.
(Single-item) auctions Vincent Conitzer v() = $5 v() = $3.
Copyright © Chang Gung University. Permission required for reproduction or display. On Femto Deployment Architecture and Macrocell Offloading Benefits.
Performance Analysis Lab,
Truthful Spectrum Auction Design for Secondary Networks Yuefei Zhu ∗, Baochun Li ∗ and Zongpeng Li † ∗ Electrical and Computer Engineering, University.
Tarun Bansal*, Karthik Sundaresan+,
Auction Theory Class 5 – single-parameter implementation and risk aversion 1.
Approximating optimal combinatorial auctions for complements using restricted welfare maximization Pingzhong Tang and Tuomas Sandholm Computer Science.
An Approximate Truthful Mechanism for Combinatorial Auctions An Internet Mathematics paper by Aaron Archer, Christos Papadimitriou, Kunal Talwar and Éva.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
On Cheating in Sealed-Bid Auctions Ryan Porter Yoav Shoham Computer Science Department Stanford University.
Federal Communications Commission NSMA Spectrum Management Conference May 20, 2008 Market Based Forces and the Radio Spectrum By Mark Bykowsky, Kenneth.
Auction Theory Class 3 – optimal auctions 1. Optimal auctions Usually the term optimal auctions stands for revenue maximization. What is maximal revenue?
Optimal auction design Roger Myerson Mathematics of Operations research 1981.
A Prior-Free Revenue Maximizing Auction for Secondary Spectrum Access Ajay Gopinathan and Zongpeng Li IEEE INFOCOM 2011, Shanghai, China.
Wei Dong 1 Joint work with Swati Rallapalli 1, Rittwik Jana 2, Lili Qiu 1, K. K. Ramakrishnan 2, Leonid V. Razoumov 2, Yin Zhang 1, Tae Won Cho 2 1 The.
DARWIN: Distributed and Adaptive Reputation Mechanism for Wireless Ad- hoc Networks CHEN Xiao Wei, Cheung Siu Ming CSE, CUHK May 15, 2008 This talk is.
1 Regret-based Incremental Partial Revelation Mechanism Design Nathanaël Hyafil, Craig Boutilier AAAI 2006 Department of Computer Science University of.
Preference Elicitation Partial-revelation VCG mechanism for Combinatorial Auctions and Eliciting Non-price Preferences in Combinatorial Auctions.
Seminar In Game Theory Algorithms, TAU, Agenda  Introduction  Computational Complexity  Incentive Compatible Mechanism  LP Relaxation & Walrasian.
1. problem set 12 from Binmore’s Fun and Games. p.564 Ex. 41 p.565 Ex. 42.
Bundling Equilibrium in Combinatorial Auctions Written by: Presented by: Ron Holzman Rica Gonen Noa Kfir-Dahav Dov Monderer Moshe Tennenholtz.
Algorithmic Applications of Game Theory Lecture 8 1.
Reducing Costly Information Acquisition in Auctions Kate Larson, University of Waterloo Presented by David Thompson, University of British Columbia July.
Dynamic Spectrum Management: Optimization, game and equilibrium Tom Luo (Yinyu Ye) December 18, WINE 2008.
Chapter Seventeen Auctions. Who Uses Auctions? u Owners of art, cars, stamps, machines, mineral rights etc. u Q: Why auction? u A: Because many markets.
1 Cross-Layer Design for Wireless Communication Networks Ness B. Shroff Center for Wireless Systems and Applications (CWSA) School of Electrical and Computer.
Mechanisms for a Spatially Distributed Market Moshe Babaioff, Noam Nisan and Elan Pavlov School of Computer Science and Engineering Hebrew University of.
More Powerful and Simpler Cost-Sharing Methods Carmine Ventre Joint work with Paolo Penna University of Salerno.
Exchanges = markets with many buyers and many sellers Let’s consider a 1-item 1-unit exchange first.
Competitive Analysis of Incentive Compatible On-Line Auctions Ron Lavi and Noam Nisan SISL/IST, Cal-Tech Hebrew University.
1 Quantifying Trade-Offs in Networks and Auctions Tim Roughgarden Stanford University.
Multi-unit auctions & exchanges (multiple indistinguishable units of one item for sale) Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Jian Zhao, Xiaowen Chu, Hai Liu, Yiu-Wing Leung
Introduction 1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A.
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
An Online Procurement Auction for Power Demand Response in Storage-Assisted Smart Grids Ruiting Zhou †, Zongpeng Li †, Chuan Wu ‡ † University of Calgary.
On QoS Guarantees with Reward Optimization for Servicing Multiple Priority Class in Wireless Networks YaoChing Peng Eunyoung Chang.
Combinatorial Auctions By: Shai Roitman
A novel approach of gateway selection and placement in cellular Wi-Fi system Presented By Rajesh Prasad.
GridIS: an Incentive-based Grid Scheduling Lijuan Xiao, Yanmin Zhu, Lionel M. Ni, Zhiwei Xu 19th International Parallel and Distributed Processing Symposium.
1 Deterministic Auctions and (In)Competitiveness Proof sketch: Show that for any 1  m  n there exists a bid vector b such that Theorem: Let A f be any.
Auction Theory תכנון מכרזים ומכירות פומביות Topic 7 – VCG mechanisms 1.
TRUST: A General Framework for Truthful Double Spectrum Auctions Xia Zhou Heather Zheng (University of California, Santa Barbara) Presenter: Emil Huang.
Utilizing Call Admission Control for Pricing Optimization of Multiple Service Classes in Wireless Cellular Networks Authors : Okan Yilmaz, Ing-Ray Chen.
By: Amir Ronen, Department of CS Stanford University Presented By: Oren Mizrahi Matan Protter Issues on border of economics & computation, 2002.
Fair Class-Based Downlink Scheduling with Revenue Considerations in Next Generation Broadband wireless Access Systems Bader Al-Manthari, Member, IEEE,
MAP: Multi-Auctioneer Progressive Auction in Dynamic Spectrum Access Lin Gao, Youyun Xu, Xinbing Wang Shanghai Jiaotong University.
Auctions for Digital Goods Ali Echihabi University of Waterloo – Nov 2004.
Utility-Optimal Scheduling in Time- Varying Wireless Networks with Delay Constraints I-Hong Hou P.R. Kumar University of Illinois, Urbana-Champaign 1/30.
Strategyproof Auctions For Balancing Social Welfare and Fairness in Secondary Spectrum Markets Ajay Gopinathan, Zongpeng Li University of Calgary Chuan.
TRUST:A General Framework for Truthful Double Spectrum Auctions Xia Zhou and Heather Zheng Department of Computer Science, University of California, Santa.
A New Handover Mechanism for Femtocell-to-Femtocell Adviser: Frank, Yeong - Sung Lin Presented by Li Wen Fang.
Spectrum Trading in Cognitive Radio Networks: A Contract-Theoretic Modeling Approach Lin Gao, Xinbing Wang, Youyun Xu, Qian Zhang Shanghai Jiao Tong University,
Ad Hoc Positioning System (APS) Using AOA Dragos¸ Niculescu and Badri Nath INFOCOM ’03 1 Seoyeon Kang September 23, 2008.
Automated Mechanism Design Tuomas Sandholm Presented by Dimitri Mostinski November 17, 2004.
MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,
Algorithms for Resource Allocation in HetNet Jianwei Liu Clemson University.
Price range varies from $17.99 to $34.99 or more. Device 1 Device 2 Network Connection.
Broadband Deployment Catalysts One Congressional Perspective Matthew Hussey Telecommunications Legislative Assistant Senator Olympia Snowe.
Lecture 4 on Auctions Multiunit Auctions We begin this lecture by comparing auctions with monopolies. We then discuss different pricing schemes for selling.
مهندسي سيستم‌هاي تجارت الکترونیکی Electronic Commerce System Engineering (ECSE) رشته مهندسي فناوري اطلاعات- گرايش تجارت الکترونیکی دوره کارشناسی ارشد حضوری.
False-name Bids “The effect of false-name bids in combinatorial
Near-Optimal Spectrum Allocation for Cognitive Radios: A Frequency-Time Auction Perspective Xinyu Wang Department of Electronic Engineering Shanghai.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Xinbing Wang*, Qian Zhang**
Presentation transcript:

EasyBid: Enabling Cellular Offloading via Small Players Zhixue Lu 1, Prasun Sinha 1 and R. Srikant 2 1 The Ohio State University 2 Univ. of Illinois at Urbana-Champaign 1

Cellular Data Keeps Increasing 2 Mobile Data Increases more than 60% Annually Small Cells (Femtocells) Increase Spectrum Reuse

Femtocells: the Concept Small in-home Cellular Base Station – connects to the service provider’s network through owner’s broadband network Femtocell Broadband Router Internet Core Network Femtocell Gateway 3

Femtocells: the Facts To Deploy Cellular Base Stations – Site, Backbone and Power Supply – Costly to deploy 7.9 Million Femtocells Deployed by 2013 – Almost all are residential and enterprise (small owners) Femtocells Acquiring Access to these Femtocells is Important 4

Proposed Incentive Mechanism: Auction Why Auction? : Fair and Efficient Two Types of Auctions – Forward Auction: buyers bid – Reverse Auction: sellers bid Consider a Reverse Auction Model – Buyer: the wireless service provider (WSP) – Sellers: the femtocell owners – Reason: most owners have only one femtocell 5

Background Desired Properties of Auctions – Truthfulness: bidders cannot get higher utility by lying – Individual Rationality: utility of any bidder ≥0 Common Auction Mechanisms – Secondary price auction – Reserve price based secondary auction 6

Imprecise Valuation: an Ignored Problem Existing Works Assume Precise Valuations Valuations of Femtocell Owners Depend On: – Cost of extra broadband traffic, electricity usage – Degree of overload/delay tolerance – Wiliness to provide service – May vary over time Hard to Precisely Estimate + + No Delay! = ? 7

Assumptions 8

Basic Form of Auctions in the Paper Consider Reserve-Price based Secondary Auction – Secondary auction: truthful with precise valuations – Reserve price: eliminate errors (uncertainties) in payments How It Works – Consider one seller a time – WSP sets a reserve price x – The Femtocell owner places its bid – Auction succeeds and pay x to the owner if the bid ≤ x – Utility of WSP is G-x, G: the savings of the WSP on each unit of data offloading 9

Negative Utility of Femtocells

Address Negative Utility Issue (Naïve) Worst-case IR Reserve Price 4 Payment 2

Imprecision Loss New Issue (Naïve): Imprecision Loss 12 Imprecision Loss (IL): Percentage of utility loss Due to Imprecision: 100% No Imprecision Loss Reserve Price Payment 2 No Imprecision Loss

Problem Definition 13 Imprecision Loss No Imprecision Loss Reserve Price Payment 2 No Imprecision Loss

Solution: Multiple Reserve Prices Example: 2-reserve-price Approach: – if bid ∈ [0,4), approve and pay $8 – if bid ∈ [4,10], approve with probability 2/3 and pay $10 if it is approved Truthful and IR with Precise Valuations 04 S1 S1 S2 S2 10 Payments: P i Approval Ratios: R i 14 Segments: S i

Multiple Reserve Prices In Imprecise Valuation Auction Two Reserve Prices No Imprecision Loss Imprecision Loss No Imprecision Loss S1 S1 S2 S2 15 WSP’s Expected Utility4.0 vs. 3.6 (Naïve) Imprecision Loss25% vs. 100% Percent of Sellers in IL Range40% vs. 40%

Algorithm Sketch 16

Example $8 Seller #1 $6 $1 $3 B C D E Seller #2 Seller #3 Seller #4 A SellerSeg#RatioPmt #1S1S1 18 #2S2S2 2/310 #3S2S2 2/310 #4S1S S1 S1 S2 S2 17

Simulation Result Precise Valuation – Near Optimal 18

Summary EasyBid: A Reverse Auction Mechanism for Acquiring Access to Femtocells – Introduce the notion of Perceived Valuation, Partial Truthfulness, and Imprecision Loss to characterize the quality of auctions with imprecise valuations. – Present heuristic algorithms to maximize the WSP’s utility while satisfying given constraints on partial truthfulness and imprecision loss. 19