Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
From MaRDI portal
Publication:2389651
DOI10.1016/j.artint.2007.11.007zbMath1183.68631OpenAlexW2161506569MaRDI QIDQ2389651
Nicola Gatti, Stefano Marino, Francesco Di Giunta
Publication date: 17 July 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2007.11.007
Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Agent technology and artificial intelligence (68T42)
Related Items
Human-computer negotiation in a three player market setting ⋮ Committing to correlated strategies with multiple leaders ⋮ Alternating-offers bargaining in one-to-many and many-to-many settings ⋮ Extending the alternating-offers protocol in the presence of competition: Models and theoretical analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An agenda-based framework for multi-issue negotiation
- Bargaining over multiple issues in finite horizon alternating-offers protocol
- Deadline effects and inefficient delay in bargaining with endogenous commitment
- Representations and solutions for game-theoretic problems
- Bargaining under a deadline: Evidence from the reverse ultimatum game.
- Bilateral bargaining. Theory and applications
- Non-cooperative games
- Fast algorithms for finding randomized strategies in game trees
- Computing sequential equilibria for two-player games
- A Bargaining Model with Incomplete Information About Time Preferences
- Bargaining Under Two-Sided Incomplete Information: The Unrestricted Offers Case
- Perfect Equilibrium in a Bargaining Model
- Sequential Equilibria
- Bargaining with Deadlines and Imperfect Player Control
- A Generalized Nash Solution for Two-Person Bargaining Games with Incomplete Information
