Sciweavers

79 search results - page 2 / 16
» Deliberation in Equilibrium: Bargaining in Computationally C...
Sort
View
AAAI
2006
14 years 7 days ago
A Computational Model of Logic-Based Negotiation
This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining ...
Dongmo Zhang, Yan Zhang
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
14 years 4 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
AI
2008
Springer
13 years 11 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino
CCGRID
2009
IEEE
13 years 12 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
JAIR
2008
102views more  JAIR 2008»
13 years 10 months ago
An Ordinal Bargaining Solution with Fixed-Point Property
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
Dongmo Zhang, Yan Zhang