![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Andrew Byde
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [i5]Matthias Paulik, Matt Seigel, Henry Mason, Dominic Telaar, Joris Kluivers, Rogier C. van Dalen, Chi Wai Lau, Luke Carlson, Filip Granqvist, Chris Vandevelde, Sudeep Agarwal, Julien Freudiger, Andrew Byde, Abhishek Bhowmick, Gaurav Kapoor, Si Beaumont, Áine Cahill, Dominic Hughes, Omid Javidbakht, Fei Dong, Rehan Rishi, Stanley Hung:
Federated Evaluation and Tuning for On-Device Personalization: System Design & Applications. CoRR abs/2102.08503 (2021)
2010 – 2019
- 2014
- [i4]Enrico H. Gerding, Rajdeep K. Dash, Andrew Byde, Nicholas R. Jennings:
Optimal Strategies for Simultaneous Vickrey Auctions with Perfect Substitutes. CoRR abs/1401.3433 (2014) - 2011
- [c23]Andrew Twigg, Andrew Byde, Grzegorz Milos, Tim D. Moreton, John Wilkes, Tom Wilkie:
Stratified B-trees and Versioned Dictionaries. HotStorage 2011 - [i3]Andrew Byde, Andy Twigg:
Optimal query/update tradeoffs in versioned dictionaries. CoRR abs/1103.2566 (2011) - [i2]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. 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 Exch. 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, Auctions, and Market Engineering 2006: 72-83 - [c15]David C. K. Yuen, Andrew Byde, Nicholas R. Jennings:
Heuristic Bidding Strategies for Multiple Heterogeneous Auctions. ECAI 2006: 300-304 - [i1]Andrew Byde:
A Comparison Between Mechanisms for Sequential Compute Resource Auctions. Negotiation and Market Engineering 2006 - 2004
- [c14]Elizabeth Dicke, Andrew Byde, Dave Cliff
, Paul J. Layzell:
An Ant Inspired Technique for Storage Area Network Design. BioADIT 2004: 364-379 - [c13]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
- [c12]Dave Cliff
, Vibhu Walia, Andrew Byde:
Evolved hybrid auction mechanisms in non-ZIP trader marketplaces. CIFEr 2003: 167-174 - [c11]Chris Preist, Claudio Bartolini, Andrew Byde:
Agent-based service composition through simultaneous negotiation in forward and reverse auctions. EC 2003: 55-63 - [c10]Andrew Byde:
Applying evolutionary game theory to auction mechanism design. EC 2003: 192-193 - [c9]Andrew Byde, Michael Yearworth, Kay-Yut Chen, Claudio Bartolini, Nir Vulkan:
AutONA: a system for automated multiple 1-1 negotiation. EC 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]Andrew Byde:
Applying Evolutionary Game Theory to Auction Mechanism Design. CEC 2003: 347-354 - 2002
- [c5]Andrew Byde:
A Comparison among Bidding Algorithms for Multiple Auctions. AMEC 2002: 1-16 - [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
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint