Sciweavers

1279 search results - page 198 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
SIGECOM
2009
ACM
139views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
Simple versus optimal mechanisms
The monopolist’s theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optim...
Jason D. Hartline, Tim Roughgarden
SIGMOD
1998
ACM
150views Database» more  SIGMOD 1998»
14 years 1 months ago
Extracting Schema from Semistructured Data
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
Svetlozar Nestorov, Serge Abiteboul, Rajeev Motwan...
ATAL
2008
Springer
13 years 11 months ago
Interaction-driven Markov games for decentralized multiagent planning under uncertainty
In this paper we propose interaction-driven Markov games (IDMGs), a new model for multiagent decision making under uncertainty. IDMGs aim at describing multiagent decision problem...
Matthijs T. J. Spaan, Francisco S. Melo
PASTE
2004
ACM
14 years 2 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
STOC
2010
ACM
194views Algorithms» more  STOC 2010»
14 years 1 months ago
Multi-parameter mechanism design and sequential posted pricing
We study the classic mathematical economics problem of Bayesian optimal mechanism design where a principal aims to optimize expected revenue when allocating resources to self-inte...
Shuchi Chawla, Jason Hartline, David Malec and Bal...