English
Related papers

Related papers: PPS: Privacy-Preserving Strategyproof Social-Effic…

200 papers

In the Bidder Selection Problem (BSP) there is a large pool of $n$ potential advertisers competing for ad slots on the user's web page. Due to strict computational restrictions, the advertising platform can run a proper auction only for a…

Computer Science and Game Theory · Computer Science 2024-04-30 Nickolai Gravin , Yixuan Even Xu , Renfei Zhou

Dynamic spectrum access (DSA) can effectively improve the spectrum efficiency and alleviate the spectrum scarcity, by allowing unlicensed secondary users (SUs) to access the licensed spectrum of primary users (PUs) opportunistically.…

Computer Science and Game Theory · Computer Science 2016-11-17 Lin Gao , Lingjie Duan , Jianwei Huang

Generalized Second Price (GSP) auctions are widely used by search engines today to sell their ad slots. Most search engines have supported broad match between queries and bid keywords when executing GSP auctions, however, it has been…

Computer Science and Game Theory · Computer Science 2014-04-16 Wei Chen , Di He , Tie-Yan Liu , Tao Qin , Yixin Tao , Liwei Wang

We study an abstract optimal auction problem for a single good or service. This problem includes environments where agents have budgets, risk preferences, or multi-dimensional preferences over several possible configurations of the good…

Computer Science and Game Theory · Computer Science 2012-03-23 Saeed Alaei , Hu Fu , Nima Haghpanah , Jason Hartline , Azarakhsh Malekian

The design of the best economic mechanism for Sponsored Search Auctions (SSAs) is a central task in computational mechanism design/game theory. Two open questions concern the adoption of user models more accurate than that one currently…

Computer Science and Game Theory · Computer Science 2015-11-24 Gabriele Farina , Nicola Gatti

Strategyproofness in network auctions requires that bidders not only report their valuations truthfully, but also do their best to invite neighbours from the social network. In contrast to canonical auctions, where the value-monotone…

Computer Science and Game Theory · Computer Science 2025-07-22 Yuhang Guo , Dong Hao , Bin Li , Mingyu Xiao , Bakh Khoussainov

In this paper, we investigate the joint cooperative spectrum sensing and access design problem for multi-channel cognitive radio networks. A general heterogeneous setting is considered where the probabilities that different channels are…

Networking and Internet Architecture · Computer Science 2014-04-09 Le Thanh Tan , Long Bao Le

A seller wants to sell an item to $n$ buyers. Buyer valuations are drawn i.i.d. from a distribution unknown to the seller; the seller only knows that the support is included in $[a, b]$. To be robust, the seller chooses a DSIC mechanism…

Theoretical Economics · Economics 2025-01-03 Jerry Anunrojwong , Santiago R. Balseiro , Omar Besbes

In this paper, we propose new location privacy preserving schemes for database-driven cognitive radio networks that protect secondary users' (SUs) location privacy while allowing them to learn spectrum availability in their vicinity. Our…

Networking and Internet Architecture · Computer Science 2018-06-12 Mohamed Grissa , Attila A. Yavuz , Bechir Hamdaoui

Signaling is an important topic in the study of asymmetric information in economic settings. In particular, the transparency of information available to a seller in an auction setting is a question of major interest. We introduce the study…

Computer Science and Game Theory · Computer Science 2012-04-26 Yuval Emek , Michal Feldman , Iftah Gamzu , Renato Paes Leme , Moshe Tennenholtz

It is unrealistic to assume that all nodes in an ad hoc wireless network would be willing to participate in cooperative communication, especially if their desired Quality-of- Service (QoS) is achievable via direct transmission. An…

Information Theory · Computer Science 2010-08-20 Amitav Mukherjee , Hyuck Kwon

A privacy-preserving English auction protocol with round efficiency based on a modified ring signature has been proposed in this paper. The proposed protocol has three appealing characteristic: First, it offers conditional…

Computer Science and Game Theory · Computer Science 2010-10-28 Hu Xiong , Zhong Chen

We consider the problem of cooperative spectrum sharing among a primary user (PU) and multiple secondary users (SUs) under quality of service (QoS) constraints. The SUs network is controlled by the PU through a relay which gets a revenue…

Networking and Internet Architecture · Computer Science 2016-11-17 Ramy E. Ali , Karim G. Seddik , Mohammed Nafie , Fadel F. Digham

In multi-hop secondary networks, bidding strategies for spectrum auction, route selection and relaying incentives should be jointly considered to establish multi-hop communication. In this paper, a framework for joint resource bidding and…

Computer Science and Game Theory · Computer Science 2016-11-17 Beatriz Lorenzo , Ivana Kovacevic , Ana Peleteiro , Francisco J. Gonzalez-Castano , Juan C. Burguillo

Cooperative transmission can greatly improve communication system performance by taking advantage of the broadcast nature of wireless channels. Most previous work on resource allocation for cooperation transmission is based on centralized…

Information Theory · Computer Science 2016-11-17 Jianwei Huang , Zhu Han , Mung Chiang , H. Vincent Poor

This paper investigates the design of access policies in spectrum sharing networks by exploiting the retransmission protocol of legacy primary users (PUs) to improve the spectral efficiency via opportunistic retransmissions at secondary…

Information Theory · Computer Science 2018-07-02 Nicolo Michelusi

We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions where the valuation of an agent $i$ for a set $S$ of items can be…

Computer Science and Game Theory · Computer Science 2015-05-19 Gagan Goel , Chinmay Karande , Lei Wang

We examine trade-offs among stakeholders in ad auctions. Our metrics are the revenue for the utility of the auctioneer, the number of clicks for the utility of the users and the welfare for the utility of the advertisers. We show how to…

Computer Science and Game Theory · Computer Science 2014-04-22 Yoram Bachrach , Sofia Ceppi , Ian A. Kash , Peter Key , David Kurokawa

We consider the problem of designing auctions which maximize consumer surplus (i.e., the social welfare minus the payments charged to the buyers). In the consumer surplus maximization problem, a seller with a set of goods faces a set of…

Computer Science and Game Theory · Computer Science 2025-03-18 Tomer Ezra , Daniel Schoepflin , Ariel Shaulker

Small operators who take part in secondary wireless spectrum markets typically have strict budget limits. In this paper, we study the bidding problem of a budget constrained operator in repeated secondary spectrum auctions. In existing…

Networking and Internet Architecture · Computer Science 2016-08-29 Mehrdad Khaledi , Alhussein Abouzeid