English
Related papers

Related papers: Exploiting Weak Supermodularity for Coalition-Proo…

200 papers

We present our results on Uniform Price Auctions, one of the standard sealed-bid multi-unit auction formats, for selling multiple identical units of a single good to multi-demand bidders. Contrary to the truthful and economically efficient…

Computer Science and Game Theory · Computer Science 2013-06-20 Evangelos Markakis , Orestis Telelis

We consider incentive compatible mechanisms for a domain that is very close to the domain of scheduling $n$ unrelated machines: the single exception is that the valuation of just one machine is submodular. For the scheduling problem with…

Computer Science and Game Theory · Computer Science 2019-07-31 George Christodoulou , Elias Koutsoupias , Annamaria Kovacs

Submodular functions are well-studied in combinatorial optimization, game theory and economics. The natural diminishing returns property makes them suitable for many applications. We study an extension of monotone submodular functions,…

Discrete Mathematics · Computer Science 2014-11-18 Allan Borodin , Dai Tri Man Le , Yuli Ye

One of the fundamental questions of Algorithmic Mechanism Design is whether there exists an inherent clash between truthfulness and computational tractability: in particular, whether polynomial-time truthful mechanisms for combinatorial…

Computer Science and Game Theory · Computer Science 2015-03-20 Shahar Dobzinski , Jan Vondrak

In traditional public blockchain networks, transaction fees are only allocated to full nodes (i.e., miners). However, the lack of relay rewards reduces the willingness of light nodes to relay transactions, especially in the…

Networking and Internet Architecture · Computer Science 2024-01-25 Weiyi Wang , Yutao Jiao , Jin Chen , Wenting Dai , Jiawen Kang , Yuhua Xu

In the standard single-dimensional model of position auctions, bidders agree on the relative values of the positions and each of them submits a single bid that is interpreted in terms of these values. Motivated by current practice in…

Computer Science and Game Theory · Computer Science 2018-06-22 Paul Dütting , Felix Fischer , David C. Parkes

As cellular operators are suffering from a data explosion problem, and users are consequently experiencing poor data services, the introduction of femtocells offers a cost-effective way to mitigate this problem. Femtocells enable larger…

Computer Science and Game Theory · Computer Science 2013-01-17 Sha Hua , Xuejun Zhuo , Shivendra S. Panwar

Many problems in signal processing and machine learning can be formalized as weak submodular optimization tasks. For such problems, a simple greedy algorithm (\textsc{Greedy}) is guaranteed to find a solution achieving the objective with a…

Discrete Mathematics · Computer Science 2021-11-24 Abolfazl Hashemi , Haris Vikalo , Gustavo de Veciana

Secondary spectrum auction is widely applied in wireless networks for mitigating the spectrum scarcity. In a realistic spectrum trading market, the requests from secondary users often specify the usage of a fixed spectrum frequency band in…

Computer Science and Game Theory · Computer Science 2012-08-02 He Huang , Yu-e Sun , Xiang-yang Li , Hongli Xu , Yousong Zhou , Liusheng Huang

Vehicular cloud computing has emerged as a promising solution to fulfill users' demands on processing computation-intensive applications in modern driving environments. Such applications are commonly represented by graphs consisting of…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-04-09 Zhibin Gao , Minghui LiWang , Seyyedali Hosseinalipour , Huaiyu Dai , Xianbin Wang

We study the inefficiency of mixed equilibria, expressed as the price of anarchy, of all-pay auctions in three different environments: combinatorial, multi-unit and single-item auctions. First, we consider item-bidding combinatorial…

Computer Science and Game Theory · Computer Science 2015-08-06 George Christodoulou , Alkmini Sgouritsa , Bo Tang

In digital goods auctions, there is an auctioneer who sells an item with unlimited supply to a set of potential buyers, and the objective is to design truthful auction to maximize the total profit of the auctioneer. Motivated from an…

Computer Science and Game Theory · Computer Science 2011-07-27 Nick Gravin , Pinyan Lu

In this work we are concerned with the design of efficient mechanisms while eliciting limited information from the agents. First, we study the performance of sampling approximations in facility location games. Our key result is to show that…

Computer Science and Game Theory · Computer Science 2022-08-26 Ioannis Anagnostides , Dimitris Fotakis , Panagiotis Patsilinakos

The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions the truthful direct-revelation mechanism that maximizes social welfare is the VCG mechanism. For many…

Computer Science and Game Theory · Computer Science 2013-10-14 Paul Duetting , Monika Henzinger , Martin Starnberger

Spectrum auctions are the primary mechanism through which governments allocate scarce radio frequencies, with outcomes that shape competition, coverage, and innovation in telecommunications markets. While traditional models of spectrum…

Computer Science and Game Theory · Computer Science 2025-12-10 Sara Jalili Shani , Kris Joseph , Michael B. McNally , James R. Wright

A seminal result of Bulow and Klemperer [1989] demonstrates the power of competition for extracting revenue: when selling a single item to $n$ bidders whose values are drawn i.i.d. from a regular distribution, the simple welfare-maximizing…

Computer Science and Game Theory · Computer Science 2016-12-30 Alon Eden , Michal Feldman , Ophir Friedler , Inbal Talgam-Cohen , S. Matthew Weinberg

We show that every universally truthful randomized mechanism for combinatorial auctions with submodular valuations that provides $m^{\frac 1 2 -\epsilon}$ approximation to the social welfare and uses value queries only must use…

Computer Science and Game Theory · Computer Science 2015-03-17 Shahar Dobzinski

In mechanism design, the gold standard solution concepts are dominant strategy incentive compatibility and Bayesian incentive compatibility. These solution concepts relieve the (possibly unsophisticated) bidders from the need to engage in…

Computer Science and Game Theory · Computer Science 2018-03-16 Gilles Barthe , Marco Gaboardi , Emilio Jesús Gallego Arias , Justin Hsu , Aaron Roth , Pierre-Yves Strub

Budget-feasible procurement auctions play a pivotal role in various AI-driven marketplaces, such as data acquisition and crowdsourcing, where a buyer with a limited budget seeks to procure services from strategic sellers with private costs.…

Computer Science and Game Theory · Computer Science 2026-05-04 Shuang Cui , He Huang , Yu-e Sun , Chen Xue

We study a class of procurement auctions with a budget constraint, where an auctioneer is interested in buying resources or services from a set of agents. Ideally, the auctioneer would like to select a subset of the resources so as to…

Computer Science and Game Theory · Computer Science 2017-10-10 Georgios Amanatidis , Georgios Birmpas , Evangelos Markakis