We study decision making processes with non-standard all-pay structures. We motivate this interest through a group of regulatory, political, legal, military, and economic applications where individual actions determine the consequences for a larger group or the public. The common features of...

We analyse procurement auctions in which sellers are distinguished on the basis of the ratios of quality per unit of money that they offer. Sellers are privately informed on the offered quality of the technology or good. We assume that the procurer cannot perfectly identify the best offer. Thus,...

We analyse procurement auctions in which sellers are distinguished on the basis of the ratios of quality per unit of money that they offer. Sellers are privately informed on the offered quality of the technology or good. We assume that the procurer cannot perfectly identify the best offer. Thus,...

This paper discusses the troubled relationship between contemporary advertising technology (adtech) systems, in particular systems of real-time bidding (RTB, also known as programmatic advertising) underpinning much behavioural targeting on the web and through mobile applications. This paper...

We experimentally compare a simplified version of two mechanisms that implement the Shapley value as an (ex ante) equilibrium outcome of a noncooperative bargaining procedure: one proposed by Hart and Mas-Colell (1996, H-MC) and the other by Perez-Castrillo and Wettstein (2001, PC-W). While H-MC...

One most conspicuous and curious phenomenon in online auctions is that a large fraction of goods sold have posted price clauses whereby bidders can buy the goods without taking part in the auctions. Two types of posted price clauses exemplified by Amazon and eBay are found. The paper first...

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision. -- Fair Division ; Maxmin Allocation ; Kalai...

Pairing Games or Markets studied here are the non-two-sided NTU generalization of assignment games. We show that the Equilibrium Set is nonempty, that it is the set of stable allocations or the set of semistable allocations, and that it has several notable structural properties. We also...

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision