Abstract. Demonstrating the incentive compatibility of an auction mechanism is always a hard but essential work in auction mechanism design. In this paper we discuss three different approaches to proof or check such property in regard of a multi-attribute auction mechanism: by analyzing well-known sufficient conditions, by mathematical analyzing the rules that govern the mechanism, and by empiri-cally checking the mechanism. Particularly, for dealing with the second approach, we propose a new method which consists on seeking for a counterexample with a constraint solver
Studies of bidding languages for combinatorial auctions have highlighted tradeoffs between expressiv...
In pay-per click sponsored search auctions which are currently extensively used by search engines, t...
The main question addressed in this paper is whether a theoretical outcome determined by an auction ...
Proving the incentive compatibility of an auction mechanism is always a hard but essential work in a...
Auctions have been as a competitive method of buying and selling valuable or rare items for a long t...
We characterize incentive compatibility in multi-unit auctions with multi-dimensional types. An allo...
Multi-attribute auctions allow agents to sell and purchase goods and services taking into account mo...
Multi-attribute auctions allow negotiations over multiple attributes besides price. For example in t...
We reexamine the characterization of incentive compatible single-parameter mechanisms introduced in ...
We formalize the definition of symmetric auctions to study fundamental properties of incentive compa...
Multi-attribute auctions allow negotiations over multiple attributes besides price. Multiple criteri...
Auctions are widely used on the Web. Applications range from internet advertising to platforms such ...
In this study, we address multi-attribute, multi-item auction problems. In multi-attribute auctions ...
This thesis studies the design of Bayesian revenue-optimal auctions for a class of problems in which...
This paper considers a general optimal auction problem, with many goods and with a buyer’s utility t...
Studies of bidding languages for combinatorial auctions have highlighted tradeoffs between expressiv...
In pay-per click sponsored search auctions which are currently extensively used by search engines, t...
The main question addressed in this paper is whether a theoretical outcome determined by an auction ...
Proving the incentive compatibility of an auction mechanism is always a hard but essential work in a...
Auctions have been as a competitive method of buying and selling valuable or rare items for a long t...
We characterize incentive compatibility in multi-unit auctions with multi-dimensional types. An allo...
Multi-attribute auctions allow agents to sell and purchase goods and services taking into account mo...
Multi-attribute auctions allow negotiations over multiple attributes besides price. For example in t...
We reexamine the characterization of incentive compatible single-parameter mechanisms introduced in ...
We formalize the definition of symmetric auctions to study fundamental properties of incentive compa...
Multi-attribute auctions allow negotiations over multiple attributes besides price. Multiple criteri...
Auctions are widely used on the Web. Applications range from internet advertising to platforms such ...
In this study, we address multi-attribute, multi-item auction problems. In multi-attribute auctions ...
This thesis studies the design of Bayesian revenue-optimal auctions for a class of problems in which...
This paper considers a general optimal auction problem, with many goods and with a buyer’s utility t...
Studies of bidding languages for combinatorial auctions have highlighted tradeoffs between expressiv...
In pay-per click sponsored search auctions which are currently extensively used by search engines, t...
The main question addressed in this paper is whether a theoretical outcome determined by an auction ...