Related papers: Approximation Algorithms for Secondary Spectrum Au…
We study approximation algorithms for graph pricing with vertex capacities yet without the traditional envy-free constraint. Specifically, we have a set of items $V$ and a set of customers $X$ where each customer $i \in X$ has a budget…
In this paper, we assess the applicability of auctions based on the Vickrey second price model for allocating wireless spectrum in developing countries. We first provide an overview of auction models for allocating resources. We then…
The Winner Determination Problem (WDP) in combinatorial auctions is NP-hard, and no existing method reliably predicts which instances will defeat fast greedy heuristics. The ML-for-combinatorial-optimization community has focused on…
We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…
We consider the following interference model for wireless sensor and ad hoc networks: the receiver interference of a node is the number of transmission ranges it lies in. We model transmission ranges as disks. For this case we show that…
We consider a dynamic pricing problem for repeated contextual second-price auctions with multiple strategic buyers who aim to maximize their long-term time discounted utility. The seller has limited information on buyers' overall demand…
Many spectrum auction mechanisms have been proposed for spectrum allocation problem, and unfortunately, few of them protect the bid privacy of bidders and achieve good social efficiency. In this paper, we propose PPS, a Privacy Preserving…
The interference imposes a significant negative impact on the performance of wireless networks. With the continuous deployment of larger and more sophisticated wireless networks, reducing interference in such networks is quickly being…
We develop a unified ascending-auction framework for computing Walrasian equilibria in combinatorial markets with strong substitutes valuations and piecewise-linear payment functions. Our auction extends the celebrated ascending auctions of…
Device to device communication has prevailed as an issue for small cell networks. Here we have implemented a new scheme that allows us to improve spectral capabilities of mobiles communicating with each other (peer to peer network) for…
An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available: power control, scheduling, routing, channel assignment and…
We consider the fair allocation of indivisible items to several agents and add a graph theoretical perspective to this classical problem. Namely, we introduce an incompatibility relation between pairs of items described in terms of a…
The linear complementarity problem is a continuous optimization problem that generalizes convex quadratic programming, Nash equilibria of bimatrix games and several such problems. This paper presents a continuous optimization formulation…
Recent spectrum auctions in the United Kingdom, and some proposals for future auctions of spectrum in the United States, are based on preliminary price discovery rounds, followed by calculation of final prices for the winning buyers. For…
An important aspect of the Future Internet is the efficient utilization of (wireless) network resources. In order for the - demanding in terms of QoS - Future Internet services to be provided, the current trend is evolving towards an…
We consider an online multi-weighted generalization of several classic online optimization problems, called the online combinatorial assignment problem. We are given an independence system over a ground set of elements and agents that…
Wireless Mesh Networks (WMNs) have evolved into a wireless communication technology of immense interest. But technological advancements in WMNs have inadvertently spawned a plethora of network performance bottlenecks, caused primarily by…
This paper proposes the first known universal interference alignment scheme for general $(1\times{}1)^K$ interference networks, either Gaussian or deterministic, with only 2 symbol extension. While interference alignment is theoretically…
We introduce several new estimation methods that leverage shape constraints in auction models to estimate various objects of interest, including the distribution of a bidder's valuations, the bidder's ex ante expected surplus, and the…
This paper studies inference in first-price and second-price sealed-bid auctions with many bidders, using an asymptotic framework where the number of bidders increases while the number of auctions remains fixed. Our approach enables…