Cover Image

Robin Hood Reachability Bidding Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Almagor, Shaull, Avni, Guy, Dafni, Neta
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bidding Games on Markov Decision Processes with Quantitative Reachability Objectives
by: Avni, Guy, et al.
Published: (2024)

Bidding Games with Charging
by: Avni, Guy, et al.
Published: (2024)

Computing Threshold Budgets in Discrete-Bidding Games
by: Avni, Guy, et al.
Published: (2022)

Mean-payoff and Energy Discrete Bidding Games
by: Avni, Guy, et al.
Published: (2025)

Quantitative Semantics for Jumping Automata
by: Almagor, Shaull, et al.
Published: (2024)

A Game of Pawns
by: Avni, Guy, et al.
Published: (2023)

Permissive Equilibria in Multiplayer Reachability Games
by: Goeminne, Aline, et al.
Published: (2024)

Multi-weighted Reachability Games and Their Application to Permissiveness
by: Brihaye, Thomas, et al.
Published: (2023)

Verification of Correlated Equilibria in Concurrent Reachability Games
by: Rajasekaran, Senthil, et al.
Published: (2026)

Generalised Reachability Games Revisited
by: Bose, Sougata, et al.
Published: (2025)

Greedy Routing Reachability Games
by: Lenzner, Pascal, et al.
Published: (2026)

Games on Graphs: A Time-Efficient Algorithm for Solving Finite Reachability and Safety Games
by: Giannetti, Christian
Published: (2024)

Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games
by: Main, James C. A.
Published: (2023)

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

Memoryless Strategies in Stochastic Reachability Games
by: Kiefer, Stefan, et al.
Published: (2024)

Mechanism Design with Delegated Bidding
by: Aggarwal, Gagan, et al.
Published: (2024)

Generative Bid Shading in Real-Time Bidding Advertising
by: Huang, Yinqiu, et al.
Published: (2025)

Auction-Based Scheduling
by: Avni, Guy, et al.
Published: (2023)

Determinization of Min-Plus Weighted Automata is Decidable
by: Almagor, Shaull, et al.
Published: (2025)

Automated Approach for Solving Infinite-state Polynomial Reachability Games
by: Chatterjee, Krishnendu, et al.
Published: (2026)

Bid-aggregation based clearing of day-ahead electricity markets
by: Feczkó, Botond, et al.
Published: (2020)

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

Rethinking Pricing in Energy Markets: Pay-as-Bid vs Pay-as-Clear
by: Caragiannis, Ioannis, et al.
Published: (2025)

Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives
by: Brihaye, Thomas, et al.
Published: (2023)

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

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

Strategic Bidding in Knapsack Auctions
by: Khezr, Peyman, et al.
Published: (2024)

Learning in Zero-Sum Markov Games: Relaxing Strong Reachability and Mixing Time Assumptions
by: Ouhamma, Reda, et al.
Published: (2023)

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

Reachability and Safety Games under TSO Semantics (Extended Version)
by: Spengler, Stephan
Published: (2024)

Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
by: Berthon, Raphaël, et al.
Published: (2024)

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

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

The Bidding Games: Reinforcement Learning for MEV Extraction on Polygon Blockchain
by: Seoev, Andrei, et al.
Published: (2025)

HiBid: A Cross-Channel Constrained Bidding System with Budget Allocation by Hierarchical Offline Deep Reinforcement Learning
by: Wang, Hao, et al.
Published: (2023)

Learning-Augmented Online Bidding in Stochastic Settings
by: Angelopoulos, Spyros, et al.
Published: (2025)

Bidding efficiently in Simultaneous Ascending Auctions with budget and eligibility constraints using Simultaneous Move Monte Carlo Tree Search
by: Pacaud, Alexandre, et al.
Published: (2023)

Reachability of Fair Allocations via Sequential Exchanges
by: Igarashi, Ayumi, et al.
Published: (2023)

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

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