Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification
From MaRDI portal
Publication:5130014
DOI10.1613/jair.1.11525zbMath1492.91139arXiv1812.01955OpenAlexW3094182366MaRDI QIDQ5130014
Benjamin Lubin, Vitor Bosshard, Benedikt Bünz, Sven Seuken
Publication date: 3 November 2020
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.01955
Auctions, bargaining, bidding and selling, and other market models (91B26) Algorithmic game theory and complexity (91A68) Games with incomplete information, Bayesian games (91A27)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types
- Adaptive moving mesh methods
- Consistency and cautious fictitious play
- A simple and relatively efficient triangulation of the n-cube
- Quasi-Monte Carlo integration
- Core-selecting auctions with incomplete information
- The return function: a new computable perspective on Bayesian-Nash equilibria
- Core-selecting package auctions
- Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions
- Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities
- Monotone Equilibrium in Multi-Unit Auctions
- Menu Auctions, Resource Allocation, and Economic Influence
- `` Direct Search Solution of Numerical and Statistical Problems
- Some Guidelines and Guarantees for Common Random Numbers
- Incentives in Teams
- Single Crossing Properties and the Existence of Pure Strategy Equilibria in Games of Incomplete Information
- On the impossibility of core-selecting auctions
- Quadratic Core-Selecting Payment Rules for Combinatorial Auctions
- Games With Discontinuous Payoffs: A Strengthening of Reny's Existence Theorem
- Probability Inequalities for Sums of Bounded Random Variables
- Existence of Equilibrium in Single and Double Private Value Auctions1
- An algorithm with guaranteed convergence for finding a zero of a function
