English
Related papers

Related papers: The Polyhedral Geometry of Truthful Auctions

200 papers

In this research, we study the problem that a collector acquires items from the owner based on the item qualities the owner declares and an independent appraiser's assessments. The owner is interested in maximizing the probability that the…

Computer Science and Game Theory · Computer Science 2024-02-23 Liang Shan , Shuo Zhang , Jie Zhang , Zihe Wang

We study the design of mechanisms -- e.g., auctions -- when the designer does not control information flows between mechanism participants. A mechanism equilibrium is leakage-proof if no player conditions their actions on leaked…

Theoretical Economics · Economics 2025-11-04 Samuel Häfner , Marek Pycia , Haoyuan Zeng

Spatial structure has a profound effect on the outcome of evolutionary games. In the ultimatum game, it leads to the dominance of much fairer players than those predicted to evolve in well-mixed settings. Here we show that spatiality leads…

Physics and Society · Physics 2012-11-09 Attila Szolnoki , Matjaz Perc , Gyorgy Szabo

We consider a class of auctions (Lowest Unique Bid Auctions) that have achieved a considerable success on the Internet. Bids are made in cents (of euro) and every bidder can bid as many numbers as she wants. The lowest unique bid wins the…

Probability · Mathematics 2010-07-27 Marco Scarsini , Eilon Solan , Nicolas Vieille

Recently introduced composition operator for credal sets is an analogy of such operators in probability, possibility, evidence and valuation-based systems theories. It was designed to construct multidimensional models (in the framework of…

Artificial Intelligence · Computer Science 2017-05-10 Jiřina Vejnarová , Václav Kratochvíl

We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and the seller must make the allocation and payment decisions…

Computer Science and Game Theory · Computer Science 2009-05-22 Moshe Babaioff , Liad Blumrosen , Aaron L. Roth

In a recent work we have shown how to construct an information algebra of coherent sets of gambles defined on general possibility spaces. Here we analyze the connection of such an algebra with the set algebra of subsets of the possibility…

Logic in Computer Science · Computer Science 2021-05-28 Juerg Kohlas , Arianna Casanova , Marco Zaffalon

Algorithms of control of differential equations solutions are under investigation in the article. Idealized and real modifications of the algorithms are distinguished. An equation, which can be the base equation for investigation of the…

Numerical Analysis · Computer Science 2016-01-05 Yu. V. Troshchiev

We investigate revenue guarantees for auction mechanisms in a model where a distribution is specified for each bidder, but only some of the distributions are correct. The subset of bidders whose distribution is correctly specified…

Computer Science and Game Theory · Computer Science 2020-07-22 Makis Arsenis , Odysseas Drosis , Robert Kleinberg

Consider the problem of allocating goods to buyers through an auction. An auction is efficient if the resulting allocation maximizes total welfare, conditional on the information available. If buyers have private values, the…

Computer Science and Game Theory · Computer Science 2018-05-23 Andrei Ciupan

Mean-payoff games are important quantitative models for open reactive systems. They have been widely studied as games of full observation. In this paper we investigate the algorithmic properties of several sub-classes of mean-payoff games…

Computer Science and Game Theory · Computer Science 2017-10-10 Paul Hunter , Arno Pauly , Guillermo A. Pérez , Jean-François Raskin

The set of all m-tuples of compatible full conditional distributions on discrete random variables is an algebraic set whose defining ideal is a unimodular toric ideal. We identify the defining polynomials of these ideals with closed walks…

Algebraic Geometry · Mathematics 2007-06-13 Aleksandra B Slavkovic , Seth Sullivant

We study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of $n$ players, the maximin share of a single player is the best she can guarantee to herself, if she would partition…

Computer Science and Game Theory · Computer Science 2016-05-16 Georgios Amanatidis , Georgios Birmpas , Evangelos Markakis

We characterize the statistical properties of a large number of online auctions run on eBay. Both stationary and dynamic properties, like distributions of prices, number of bids etc., as well as relations between these quantities are…

Physics and Society · Physics 2009-11-13 Alireza Namazi , Andreas Schadschneider

This paper describes a study of agent bidding strategies, assuming combinatorial valuations for complementary and substitutable goods, in three auction environments: sequential auctions, simultaneous auctions, and the Trading Agent…

Computer Science and Game Theory · Computer Science 2012-07-19 Amy Greenwald , Justin Boyan

Quantitative measures of randomness in games are useful for game design and have implications for gambling law. We treat the outcome of a game as a random variable and derive a closed-form expression and estimator for the variance in the…

Other Statistics · Statistics 2020-09-11 Alex Cloud , Eric Laber

Algorithmic Mechanism Design attempts to marry computation and incentives, mainly by leveraging monetary transfers between designer and selfish agents involved. This is principally because in absence of money, very little can be done to…

Computer Science and Game Theory · Computer Science 2013-10-02 Dimitris Fotakis , Piotr Krysta , Carmine Ventre

Visualization dashboards are increasingly used in strategic settings like auctions to enhance decision-making and reduce strategic confusion. This paper presents behavioral experiments evaluating how different dashboard designs affect bid…

Computer Science and Game Theory · Computer Science 2025-07-29 Paula Kayongo , Jessica Hullman , Jason Hartline

Optimal mechanisms have been provided in quite general multi-item settings, as long as each bidder's type distribution is given explicitly by listing every type in the support along with its associated probability. In the implicit setting,…

Computer Science and Game Theory · Computer Science 2015-03-09 Constantinos Daskalakis , Alan Deckelbaum , Christos Tzamos

In a seminal paper, McAfee (1992) presented a truthful mechanism for double auctions, attaining asymptotically-optimal gain-from-trade without any prior information on the valuations of the traders. McAfee's mechanism handles…

Computer Science and Game Theory · Computer Science 2017-12-20 Erel Segal-Halevi , Avinatan Hassidim , Yonatan Aumann