Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Andrew Byde
2010 – today
- 2011
[i2]Andrew Byde, Andy Twigg: Optimal query/update tradeoffs in versioned dictionaries. CoRR abs/1103.2566 (2011)
[i1]Andrew Twigg, Andrew Byde, Grzegorz Milos, Tim D. Moreton, John Wilkes, Tom Wilkie: Stratified B-trees and versioning dictionaries. CoRR abs/1103.4282 (2011)
2000 – 2009
- 2009
[c22]Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Endre Tarjan: Efficiently Generating k-Best Solutions to Procurement Auctions. AAIM 2009: 68-84
[c21]Andrew Byde, Maria Polukarov, Nicholas R. Jennings: Games with Congestion-Averse Utilities. SAGT 2009: 220-232
[c20]Thomas Voice, Maria Polukarov, Andrew Byde, Nicholas R. Jennings: On the Impact of Strategy and Utility Structures on Congestion-Averse Games. WINE 2009: 600-607- 2008
[j2]Enrico H. Gerding, Rajdeep K. Dash, Andrew Byde, Nicholas R. Jennings: Optimal Strategies for Simultaneous Vickrey Auctions with Perfect Substitutes. J. Artif. Intell. Res. (JAIR) 32: 939-982 (2008)
[c19]Enrico H. Gerding, Zinovi Rabinovich, Andrew Byde, Edith Elkind, Nicholas R. Jennings: Approximating mixed Nash equilibria using smooth fictitious play in simultaneous auctions. AAMAS (3) 2008: 1577-1580- 2007
[c18]Andrew Byde, Hui Wan, Steve Cayzer: Personalized Tag Recommendations via Tagging and Content-based Similarity Metrics. ICWSM 2007- 2006
[j1]Terence Kelly, Andrew Byde: Generating k-best solutions to auction winner determination problems. SIGecom Exchanges 6(1): 23-34 (2006)
[c17]Andrew Byde: A comparison between mechanisms for sequential compute resource auctions. AAMAS 2006: 1199-1201
[c16]Andrew Byde: A Comparison Between Mechanisms for Sequential Compute Resource Auctions. Negotiation and Market Engineering 2006
[c15]Andrew Byde: A Comparison Between Mechanisms for Sequential Compute Resource Auctions. Negotiation, Auctions, and Market Engineering 2006: 72-83
[c14]David C. K. Yuen, Andrew Byde, Nicholas R. Jennings: Heuristic Bidding Strategies for Multiple Heterogeneous Auctions. ECAI 2006: 300-304- 2004
[c13]Elizabeth Dicke, Andrew Byde, Dave Cliff, Paul J. Layzell: An Ant Inspired Technique for Storage Area Network Design. BioADIT 2004: 364-379
[c12]Elizabeth Dicke, Andrew Byde, Paul J. Layzell, Dave Cliff: Using a Genetic Algorithm to Design and Improve Storage Area Network Architectures. GECCO (1) 2004: 1066-1077- 2003
[c11]Chris Preist, Claudio Bartolini, Andrew Byde: Agent-based service composition through simultaneous negotiation in forward and reverse auctions. ACM Conference on Electronic Commerce 2003: 55-63
[c10]Andrew Byde: Applying evolutionary game theory to auction mechanism design. ACM Conference on Electronic Commerce 2003: 192-193
[c9]Andrew Byde, Michael Yearworth, Kay-Yut Chen, Claudio Bartolini, Nir Vulkan: AutONA: a system for automated multiple 1-1 negotiation. ACM Conference on Electronic Commerce 2003: 198-199
[c8]Andrew Byde, Michael Yearworth, Kay-Yut Chen, Claudio Bartolini: AutONA: A System for Automated Multiple 1-1 Negotiation. CEC 2003: 59-67
[c7]Vibhu Walia, Andrew Byde, Dave Cliff: Evolving Market Design in Zero-Intelligence Trader Markets. CEC 2003: 157-164
[c6]- 2002
[c5]
[c4]Andrew Byde, Chris Preist, Nicholas R. Jennings: Decision procedures for multiple auctions. AAMAS 2002: 613-620
[c3]Andrew Byde, Giacomo Piccinelli, Winfried Lamersdorf: Automating Negotiation over B2B Processes. DEXA Workshops 2002: 660-664- 2001
[c2]Chris Preist, Andrew Byde, Claudio Bartolini: Economic dynamics of agents in multiple auctions. Agents 2001: 545-551
[c1]Andrew Byde: A Dynamic Programming Model for Algorithm Design in Simultaneous Auctions. WELCOM 2001: 152-163
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-03-06 20:29 CET by the dblp team



