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

Kevin M. Lochner

dblp:45/1654 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

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

Artificial intelligence and machine learning · 5Theory of computation · 2Graphics, computer vision, multimedia, augmented reality and games · 1

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
3 papers
Algorithmic game theory and mechanism design · 94% Graph algorithms and graph theory · 6%
Artificial intelligence
1 paper
Multi-agent systems · 50% Knowledge representation and reasoning · 50%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › mechanism design
auction design
0.112006
Bid expressiveness and clearing algorithms in multiattribute double auctions · EC 2006
Algorithmic game theory and mechanism design › mechanism design › auction design
double auction
0.112006
Bid expressiveness and clearing algorithms in multiattribute double auctions · EC 2006
Algorithmic game theory and mechanism design
matching
0.112006
Bid expressiveness and clearing algorithms in multiattribute double auctions · EC 2006
Knowledge, reasoning and agents › Knowledge representation and reasoning › uncertainty reasoning
approximate reasoning
0.112005
Approximate Strategic Reasoning through Hierarchical Reduction of Large Symmetric Games · AAAI 2005
Knowledge, reasoning and agents › Multi-agent systems › multi-agent reasoning
strategic reasoning
0.112005
Approximate Strategic Reasoning through Hierarchical Reduction of Large Symmetric Games · AAAI 2005
Algorithmic game theory and mechanism design › non-cooperative game › strategic game
symmetric game
0.112005
Approximate Strategic Reasoning through Hierarchical Reduction of Large Symmetric Games · AAAI 2005
Algorithmic game theory and mechanism design
market design
0.012003
Price prediction in a trading agent competition (extended abstract) · EC 2003
Graph algorithms and graph theory › graph algorithms
network flow
0.012006
Bid expressiveness and clearing algorithms in multiattribute double auctions · EC 2006

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

hierarchical reduction · 0.1network flow · 0.1multiattribute utility theory · 0.1complexity analysis · 0.1
YearPublicationVenuePosition
2006 Bid expressiveness and clearing algorithms in multiattribute double auctions
abstract
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting computational problem of determining an optimal set of trades. We develop a formal semantic framework for characterizing expressible offers, and show conditions under which the allocation problem can be separated into first identifying optimal pairwise trades and subsequently optimizing combinations of those trades. We analyze the bilateral matching problem while taking into consideration relevant results from multiattribute utility theory. Network flow models we develop for computing global allocations facilitate classification of the problem space by computational complexity, and provide guidance for developing solution algorithms. Experimental trials help distinguish tractable problem classes for proposed solution techniques.
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
EC3
2005 Approximate Strategic Reasoning through Hierarchical Reduction of Large Symmetric Games
Michael P. Wellman, Daniel M. Reeves, Kevin M. Lochner, Shih-Fen Cheng, Rahul Suri
AAAI3
2005 Walverine: a Walrasian trading agent
Shih-Fen Cheng, Evan Leung, Kevin M. Lochner, Kevin O'Malley, Daniel M. Reeves, L. Julian Schvartzman, Michael P. Wellman
Decis. Support Syst.3
2004 Price Prediction in a Trading Agent Competition
abstract
The 2002 Trading Agent Competition (TAC) presented a challenging market game in the domain of travel shopping. One of the pivotal issues in this domain is uncertainty about hotel prices, which have a significant influence on the relative cost of alternative trip schedules. Thus, virtually all participants employ some method for predicting hotel prices. We survey approaches employed in the tournament, finding that agents apply an interesting diversity of techniques, taking into account differing sources of evidence bearing on prices. Based on data provided by entrants on their agents' actual predictions in the TAC-02 finals and semifinals, we analyze the relative efficacy of these approaches. The results show that taking into account game-specific information about flight prices is a major distinguishing factor. Machine learning methods effectively induce the relationship between flight and hotel prices from game data, and a purely analytical approach based on competitive equilibrium analysis achieves equal accuracy with no historical data. Employing a new measure of prediction quality, we relate absolute accuracy to bottom-line performance in the game.
Michael P. Wellman, Daniel M. Reeves, Kevin M. Lochner, Yevgeniy Vorobeychik
J. Artif. Intell. Res.3
2003 Price prediction in a trading agent competition (extended abstract)
abstract
The 2002 Trading Agent Competition (TAC) presents a challenging market game in the domain of travel shopping. One of the pivotal issues in this domain is uncertainty about hotel prices, which have a significant influence on the relative cost of alternative trip schedules. We survey agent approaches, finding an interesting diversity of techniques, taking into account differing sources of evidence bearing on prices. Based on agents' actual predictions in the TAC-02 finals and semifinals, we analyze the relative efficacy of these approaches. Employing a new measure of prediction quality, we relate absolute accuracy to bottom-line performance in the game.
Michael P. Wellman, Daniel M. Reeves, Kevin M. Lochner
EC3