Imagen de Portada

Bidding efficiently in Simultaneous Ascending Auctions with budget and eligibility constraints using Simultaneous Move Monte Carlo Tree Search

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Pacaud, Alexandre, Bechler, Aurelien, Coupechoux, Marceau
Formato:	Preprint
Publicado:	2023
Materias:	Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Bidding efficiently in Simultaneous Ascending Auctions with incomplete information using Monte Carlo Tree Search and determinization
por: Pacaud, Alexandre, et al.
Publicado: (2024)

Dynamics of multidimensional Simple Clock Auctions
por: Zeroual, Jad, et al.
Publicado: (2025)

The Combinatorial Multi-Round Ascending Auction
por: Kasberger, Bernhard, et al.
Publicado: (2022)

Strategic Bidding in Knapsack Auctions
por: Khezr, Peyman, et al.
Publicado: (2024)

Simultaneous All-Pay Auctions with Budget Constraints
por: Liu, Yan, et al.
Publicado: (2025)

A Simplified Analysis of the Ascending Auction to Sell a Matroid Base
por: Peis, Britta, et al.
Publicado: (2024)

Applying Opponent Modeling for Automatic Bidding in Online Repeated Auctions
por: Hu, Yudong, et al.
Publicado: (2022)

Strategic Bidding Wars in On-chain Auctions
por: Wu, Fei, et al.
Publicado: (2023)

Simultaneous AlphaZero: Extending Tree Search to Markov Games
por: Becker, Tyler, et al.
Publicado: (2025)

Incentive Mechanism for Mobile Crowd Sensing with Assumed Bid Cost Reverse Auction
por: Yangchin, Jowa, et al.
Publicado: (2025)

iMLCA: Machine Learning-powered Iterative Combinatorial Auctions with Interval Bidding
por: Lubin, Benjamin, et al.
Publicado: (2020)

Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity
por: Wang, Yige, et al.
Publicado: (2026)

Prior-Independent Bidding Strategies for First-Price Auctions
por: Kumar, Rachitesh, et al.
Publicado: (2025)

Strategic Bid Shading in Real-Time Bidding Auctions in Ad Exchange Using Minority Game Theory
por: Das, Dipankar
Publicado: (2025)

Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions
por: Kumar, Rachitesh, et al.
Publicado: (2024)

Double Distributionally Robust Bid Shading for First Price Auctions
por: Qu, Yanlin, et al.
Publicado: (2024)

Simplifications to Guide Monte Carlo Tree Search in Combinatorial Games
por: Haythorpe, Michael, et al.
Publicado: (2025)

Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
por: Han, Yanjun, et al.
Publicado: (2020)

Learning to Bid in Non-Stationary Repeated First-Price Auctions
por: Hu, Zihao, et al.
Publicado: (2025)

Strategic Bidding in 6G Spectrum Auctions with Large Language Models
por: Lotfi, Ismail, et al.
Publicado: (2026)

Flexible Bidding in Service-Oriented Combinatorial Spectrum Forward Auctions
por: Shao, Xiang, et al.
Publicado: (2025)

Online Causal Inference for Advertising in Real-Time Bidding Auctions
por: Waisman, Caio, et al.
Publicado: (2019)

Simultaneously Satisfying MXS and EFL
por: Ashuri, Arash, et al.
Publicado: (2024)

Joint Value Estimation and Bidding in Repeated First-Price Auctions
por: Wen, Yuxiao, et al.
Publicado: (2025)

Designing Auctions when Algorithms Learn to Bid
por: Rawat, Pranjal
Publicado: (2023)

Generative Auto-Bidding in Large-Scale Competitive Auctions via Diffusion Completer-Aligner
por: Li, Yewen, et al.
Publicado: (2025)

Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity
por: Wang, Yige, et al.
Publicado: (2025)

Shill Bidding Prevention in Decentralized Auctions Using Smart Contracts
por: Bouaicha, M. A., et al.
Publicado: (2025)

A Lightweight MPC Bidding Framework for Brand Auction Ads
por: Chen, Yuanlong, et al.
Publicado: (2026)

Pair-Bid Auction Model for Optimized Network Slicing in 5G RAN
por: Li, Mengyao, et al.
Publicado: (2025)

Sponsored Search Auction Design Beyond Single Utility Maximization
por: Xu, Changfeng, et al.
Publicado: (2024)

Ascending Auctions for Combinatorial Markets with Frictions: A Unified Framework via Discrete Convex Analysis
por: Oki, Taihei, et al.
Publicado: (2026)

Bidding Games with Charging
por: Avni, Guy, et al.
Publicado: (2024)

Socially efficient mechanism on the minimum budget
por: Kinoshita, Hirota, et al.
Publicado: (2024)

Achieving EF1 and Epistemic EFX Guarantees Simultaneously
por: Akrami, Hannaneh, et al.
Publicado: (2026)

Simultaneous Ordinal Maximin Share and Envy-Based Guarantees
por: Akrami, Hannaneh, et al.
Publicado: (2026)

Simultaneous Best-Response Dynamics in Random Potential Games
por: Ashkenazi-Golan, Galit, et al.
Publicado: (2025)

Mechanism Design with Delegated Bidding
por: Aggarwal, Gagan, et al.
Publicado: (2024)

Best-response Algorithms for Lattice Convex-Quadratic Simultaneous Games
por: Sankaranarayanan, Sriram
Publicado: (2024)

Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously
por: Akrami, Hannaneh, et al.
Publicado: (2024)