In this note, we present a statistical-physics framework for combinatorial auctions, i.e. multi-item auctions where bidders bid on combinations of items. The combinatorial problem is represented as a lattice-gas model, such that methods from the statistical physics of complex, disordered systems can be applied. In a minimal probabilistic setting, we find a phase transition from an easily solvable to a harder phase, where the solution space becomes clustered. In addition, the reformulation as a statistical-physics model allows the introduction of new and efficient message passing algorithms for single CA instances
We design and analyze deterministic truthful approximation mechanisms for multi-unit Combinatorial A...
We study incentive compatible mechanisms for Combinatorial Auctions where the bidders have submodula...
AbstractAuctions are the most widely used strategic game-theoretic mechanisms in the Internet. Aucti...
Combinatorial auctions are formulated as frustrated lattice gases on sparse random graphs, allowing ...
This thesis concerns the interdisciplinary field of combinatorial auctions, combining the fields of ...
The thesis consists of four papers on combinatorial auctions and a summary. The first part is more o...
A combinatorial auction is an auction where multiple items are for sale simultaneously to a set of b...
A combinatorial auction is an auction where multiple items are for sale simultaneously to a set of b...
AbstractWe present a new framework for the design of computationally-efficient and incentive-compati...
Combinatorial auctions are auction formats that allow agents to submit single bids for a set of dist...
Combinatorial auctions provide an important tool for mechanism design in multi-agent systems. When i...
Combinatorial exchanges are double sided marketplaces with multiple sellers and multiple buyers trad...
In combinatorial auctions, multiple distinct items are sold simultaneously and a bidder may place a ...
We design and analyze deterministic truthful approximation mechanisms for multi-unit Combinatorial A...
We present a general framework for approximately reducing the mechanism design prob-lem for multiple...
We design and analyze deterministic truthful approximation mechanisms for multi-unit Combinatorial A...
We study incentive compatible mechanisms for Combinatorial Auctions where the bidders have submodula...
AbstractAuctions are the most widely used strategic game-theoretic mechanisms in the Internet. Aucti...
Combinatorial auctions are formulated as frustrated lattice gases on sparse random graphs, allowing ...
This thesis concerns the interdisciplinary field of combinatorial auctions, combining the fields of ...
The thesis consists of four papers on combinatorial auctions and a summary. The first part is more o...
A combinatorial auction is an auction where multiple items are for sale simultaneously to a set of b...
A combinatorial auction is an auction where multiple items are for sale simultaneously to a set of b...
AbstractWe present a new framework for the design of computationally-efficient and incentive-compati...
Combinatorial auctions are auction formats that allow agents to submit single bids for a set of dist...
Combinatorial auctions provide an important tool for mechanism design in multi-agent systems. When i...
Combinatorial exchanges are double sided marketplaces with multiple sellers and multiple buyers trad...
In combinatorial auctions, multiple distinct items are sold simultaneously and a bidder may place a ...
We design and analyze deterministic truthful approximation mechanisms for multi-unit Combinatorial A...
We present a general framework for approximately reducing the mechanism design prob-lem for multiple...
We design and analyze deterministic truthful approximation mechanisms for multi-unit Combinatorial A...
We study incentive compatible mechanisms for Combinatorial Auctions where the bidders have submodula...
AbstractAuctions are the most widely used strategic game-theoretic mechanisms in the Internet. Aucti...