Home › Entities › academia › Bidding in Periodic Double Auctions Using Heuristics and Dynamic Monte Carlo Tree Search

Bidding in Periodic Double Auctions Using Heuristics and Dynamic Monte Carlo Tree Search

Research article (Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018) · cited 15× · AI/ML
academia openalex:W2808166200
Press Enter · cited answer in seconds

Bidding in Periodic Double Auctions Using Heuristics and Dynamic Monte Carlo Tree Search

Summary

Bidding in Periodic Double Auctions Using Heuristics and Dynamic Monte Carlo Tree Search is a scholarly article[1].

Key Facts

  • Bidding in Periodic Double Auctions Using Heuristics and Dynamic Monte Carlo Tree Search's instance of is recorded as scholarly article[2].

Related Entities

Christopher Kiekintveld

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Bidding in Periodic Double Auctions Using Heuristics and Dynamic Monte Carlo Tree Search. Retrieved May 24, 2026, from https://4ort.xyz/entity/bidding-in-periodic-double-auctions-using-heuristics-and-dynamic-monte-carlo-tree-search
MLA “Bidding in Periodic Double Auctions Using Heuristics and Dynamic Monte Carlo Tree Search.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/bidding-in-periodic-double-auctions-using-heuristics-and-dynamic-monte-carlo-tree-search.
BibTeX @misc{4ortxyz_bidding-in-periodic-double-auctions-using-heuristics-and-dynamic-monte-carlo-tree-search_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Bidding in Periodic Double Auctions Using Heuristics and Dynamic Monte Carlo Tree Search}}, year = {2026}, url = {https://4ort.xyz/entity/bidding-in-periodic-double-auctions-using-heuristics-and-dynamic-monte-carlo-tree-search}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Bidding in Periodic Double Auctions Using Heuristics and Dynamic Monte Carlo Tree Search — https://4ort.xyz/entity/bidding-in-periodic-double-auctions-using-heuristics-and-dynamic-monte-carlo-tree-search (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/bidding-in-periodic-double-auctions-using-heuristics-and-dynamic-monte-carlo-tree-search · Last refreshed: