DeepAI AI Chat
Log In Sign Up

Non-decreasing Payment Rules for Combinatorial Auctions

06/07/2022
by   Vitor Bosshard, et al.
Universität Zürich
EPFL
0

Combinatorial auctions are used to allocate resources in domains where bidders have complex preferences over bundles of goods. However, the behavior of bidders under different payment rules is not well understood, and there has been limited success in finding Bayes-Nash equilibria of such auctions due to the computational difficulties involved. In this paper, we introduce non-decreasing payment rules. Under such a rule, the payment of a bidder cannot decrease when he increases his bid, which is a natural and desirable property. VCG-nearest, the payment rule most commonly used in practice, violates this property and can thus be manipulated in surprising ways. In contrast, we show that many other payment rules are non-decreasing. We also show that a non-decreasing payment rule imposes a structure on the auction game that enables us to search for an approximate Bayes-Nash equilibrium much more efficiently than in the general case. Finally, we introduce the utility planes BNE algorithm, which exploits this structure and outperforms a state-of-the-art algorithm by multiple orders of magnitude.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/25/2022

Understanding the Relationship Between Core Constraints and Core-Selecting Payment Rules in Combinatorial Auctions

Combinatorial auctions (CAs) allow bidders to express complex preference...
06/07/2013

New Results on Equilibria in Strategic Candidacy

We consider a voting setting where candidates have preferences about the...
03/29/2023

Complexity of Equilibria in First-Price Auctions under General Tie-Breaking Rules

We study the complexity of finding an approximate (pure) Bayesian Nash e...
12/05/2018

Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification

Combinatorial auctions (CAs) are mechanisms that are widely used in prac...
11/24/2020

The Cost of Simple Bidding in Combinatorial Auctions

We study the complexity of bidding optimally in one-shot combinatorial a...
09/02/2021

The Weihrauch degree of finding Nash equilibria in multiplayer games

Is there an algorithm that takes a game in normal form as input, and out...
02/01/2021

A General Framework for the Logical Representation of Combinatorial Exchange Protocols

The goal of this paper is to propose a framework for representing and re...