Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Viet Dung Dang

dblp:00/5764 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 5 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Algorithmic game theory and mechanism design · 40% Mathematical optimization · 20% Algorithms and data structures · 20%
Artificial intelligence
2 papers
Multi-agent systems · 100%
Computer networks
1 paper
Internet of things and sensor networks · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Multi-agent systems
coalition formation
0.122007
Near-Optimal Anytime Coalition Structure Generation · IJCAI 2007
Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks · AAAI 2006
Knowledge, reasoning and agents › Multi-agent systems › coalition formation
coalition structure generation
0.112007
Near-Optimal Anytime Coalition Structure Generation · IJCAI 2007
Algorithms and data structures
anytime algorithms
0.112007
Near-Optimal Anytime Coalition Structure Generation · IJCAI 2007
Approximation and online algorithms › approximation algorithms
approximation guarantees
0.112007
Near-Optimal Anytime Coalition Structure Generation · IJCAI 2007
Algorithmic game theory and mechanism design › coalition formation
coalition structure generation
0.112007
Anytime Optimal Coalition Structure Generation · AAAI 2007
Algorithmic game theory and mechanism design
cooperative game theory
0.112007
Anytime Optimal Coalition Structure Generation · AAAI 2007
Mathematical optimization
discrete optimization
0.112007
Anytime Optimal Coalition Structure Generation · AAAI 2007
Internet of things and sensor networks › wireless sensor network
sensor fusion
0.012006
Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks · AAAI 2006

Methods — techniques the papers use, named apart from their topics

worst-case bound analysis · 0.1cooperative game theory · 0.1anytime optimization · 0.1
YearPublicationVenuePosition
2007 Anytime Optimal Coalition Structure Generation
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dang, Andrea Giovannucci, Nicholas R. Jennings
AAAI3
2007 Near-Optimal Anytime Coalition Structure Generation
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dang, Nicholas R. Jennings
IJCAI3
2006 Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks
Viet Dung Dang, Rajdeep K. Dash, Alex Rogers, Nicholas R. Jennings
AAAI1
2006 Coalition Structure Generation in Task-Based Settings
Viet Dung Dang, Nicholas R. Jennings
ECAI1
2004 Agent-based formation of virtual organisations
Timothy J. Norman, Alun D. Preece, Stuart W. Chalmers, Nicholas R. Jennings, Michael Luck, Viet Dung Dang, Thuc Duong Nguyen, Vikas Deora, Jianhua Shao 0001, W. Alex Gray, Nick J. Fiddian
Knowl. Based Syst.6
2003 Optimal clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with demand/supply function bidding
abstract
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexity of our algorithms and prove that they are guaranteed to find the optimal allocation.
Viet Dung Dang, Nicholas R. Jennings
ICEC1
2002 Polynomial algorithms for clearing multi-unit single-item and multi-unit combinatorial reverse auctions
Viet Dung Dang, Nicholas R. Jennings
ECAI1