A General Framework for the Logical Representation of Combinatorial Exchange Protocols

@inproceedings{Mittelmann2021AGF,
  title={A General Framework for the Logical Representation of Combinatorial Exchange Protocols},
  author={Munyque Mittelmann and Sylvain Bouveret and Laurent Perrussel},
  booktitle={Adaptive Agents and Multi-Agent Systems},
  year={2021}
}
The goal of this paper is to propose a framework for representing and reasoning about the rules governing a combinatorial exchange. Such a framework is at first interest as long as we want to build up digital marketplaces based on auction, a widely used mechanism for automated transactions. Combinatorial exchange is the most general case of auctions, mixing the double and combinatorial variants: agents bid to trade bundles of goods. Hence the framework should fulfill two requirements: (i) it… 

Figures from this paper

Representing and reasoning about auctions

The goal of this paper is to propose a framework for representing and reasoning about the rules of auction-based protocols. Such a framework is of interest for building digital marketplaces based on…

Combinatorial Auctions in Practice

This work describes the key representational, computational, and economic aspects of deployed combinatorial auctions and discusses behavioral economics considerations on both sides of the market, and the interrelated topics of trust, simplicity and flexibility.

References

SHOWING 1-10 OF 24 REFERENCES

Auction Description Language (ADL): General Framework for Representing Auction-Based Markets

The goal of this paper is to propose a language for representing and reasoning about the rules governing an auction-based market: the Auction Description Language (ADL), which is the first language for describing auctions in a logical framework and illustrates this general dimension by representing two different types of wellknown auctions.

A graphical formalism for mixed multi-unit combinatorial auctions

A graphical formalism, based on Petri nets, is proposed that facilitates the compact represention of both the search space and the solutions associated with the winner determination problem for mixed auctions, and allows for dramatically reduce the number of decision variables required for solving a broad class of mixed auction winner determination problems.

From General Game Descriptions to a Market Specification Language for General Trading Agents

The general Game Description Language is extended into a language that allows to formally describe arbitrary markets in such a way that these specifications can be automatically processed by a computer and illustrated by presenting axiomatizations of several well-known auction types.

Bidding Languages for Combinatorial Auctions

A new, generalized language where bids are given by propositional formulae whose subformulae can be annotated with prices is introduced, which allows bidder utilities to be formulated more naturally and concisely than existing languages.

Bidding and allocation in combinatorial auctions

It is proved that the LP approach is an optimal allocation if and only if prices can be attached to single items in the auction, and suggests greedy and branch-andbound heuristics based on LP for other cases.

ICE: An Expressive Iterative Combinatorial Exchange

The design and analysis of the first fully expressive, iterative combinatorial exchange (ICE) incorporates a tree-based bidding language (TBBL) that is concise and expressive for CEs and gives results demonstrating several aspects of its scalability and economic properties with simulated bidding strategies.

TBBL: A Tree-Based Bidding Language for Iterative Combinatorial Exchanges

A novel tree-based logical bidding language, TBBL, for preference elicitation in combinatorial exchanges (CEs), designed such that the structure in TBBL bids can be concisely captured directly in mixed-integer pro-grams for the allocation problem.

ICE: an iterative combinatorial exchange

The exchange incorporates a tree-based bidding language that is concise and expressive for CEs that allows price discovery and useful preference elicitation in early rounds, and allows termination with an efficient trade despite partial information on bidder valuations.

A hybrid approach of linear programming and logic modeling for the market core of sealed bid auctions

A constraint logic programming scheme, which combines a mathematical program with a logical inferencing technique in an integrated formalism, is introduced to implement the hybrid approach that integrates linear programming and logic modeling techniques for sealed bid auction.

Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming

This paper shows how the combinatorial auction problem and many of its extensions can be expressed in logic programming based systems such as Smodels and dlv as an alternative to the standard syntax specific specialized implementations that are much harder to modify and extend when faced with generalizations and additional constraints.