Sciweavers

ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 1 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
ALDT
2009
Springer
162views Algorithms» more  ALDT 2009»
14 years 1 months ago
Compact Preference Representation in Stable Marriage Problems
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
Enrico Pilotto, Francesca Rossi, Kristen Brent Ven...
ALDT
2009
Springer
140views Algorithms» more  ALDT 2009»
14 years 1 months ago
Directional Decomposition of Multiattribute Utility Functions
Abstract. Several schemes have been proposed for compactly representing multiattribute utility functions, yet none seems to achieve the level of success achieved by Bayesian and Ma...
Ronen I. Brafman, Yagil Engel
ALDT
2009
Springer
186views Algorithms» more  ALDT 2009»
14 years 1 months ago
The Complexity of Probabilistic Lobbying
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
Gábor Erdélyi, Henning Fernau, Judy ...
ALDT
2009
Springer
207views Algorithms» more  ALDT 2009»
14 years 1 months ago
Anytime Self-play Learning to Satisfy Functional Optimality Criteria
We present an anytime multiagent learning approach to satisfy any given optimality criterion in repeated game self-play. Our approach is opposed to classical learning approaches fo...
Andriy Burkov, Brahim Chaib-draa
ALDT
2009
Springer
110views Algorithms» more  ALDT 2009»
14 years 1 months ago
Manipulating Tournaments in Cup and Round Robin Competitions
In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the ...
Tyrel Russell, Toby Walsh
ALDT
2009
Springer
153views Algorithms» more  ALDT 2009»
14 years 1 months ago
Game Theory without Decision-Theoretic Paradoxes
Most work in game theory is conducted under the assumption that the players are expected utility maximizers. Expected utility is a very tractable decision model, but is prone to w...
Pierfrancesco La Mura
ALDT
2009
Springer
144views Algorithms» more  ALDT 2009»
14 years 1 months ago
A Complete Conclusion-Based Procedure for Judgment Aggregation
Judgment aggregation is a formal theory reasoning about how a group of agents can aggregate individual judgments on connected propositions into a collective judgment on the same pr...
Gabriella Pigozzi, Marija Slavkovik, Leendert van ...