Computer science and decision theory
From MaRDI portal
Publication:2271874
DOI10.1007/s10479-008-0328-zzbMath1170.91303OpenAlexW2024329611MaRDI QIDQ2271874
Publication date: 4 August 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0328-z
Decision theory (91B06) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (7)
Preferences in artificial intelligence ⋮ A multi-stage method for content classification and opinion mining on weblog comments ⋮ New algorithm for checking Pareto optimality in bimatrix games ⋮ A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects ⋮ Pricing and bargaining strategy of e-retail under hybrid operational patterns ⋮ Loyal customer bases as innovation disincentives for duopolistic firms using strategic signaling and Bayesian analysis ⋮ An empirical distribution of the number of subsets in the core partitions of hedonic games
Uses Software
Cites Work
- Revenue Management: Research Overview and Prospects
- Computationally Manageable Combinational Auctions
- An Analysis of Bid-Price Controls for Network Revenue Management
- On complexity as bounded rationality (extended abstract)
- Optimality and domination in repeated games with bounded players
- Combinatorial Auctions: A Survey
- Efficient sequential decision-making algorithms for container inspection operations
- The complexity of computing a Nash equilibrium
- Flash mixing
- Representing and Solving Decision Problems with Limited Information
- Combinatorial Auction Design
- A Partially Observed Markov Decision Process for Dynamic Pricing
- The Complexity of Eliminating Dominated Strategies
- How bad is selfish routing?
- Risk Aversion in Inventory Management
- Qualitative decision theory
- Shape distributions
- Optimal Auctions with Simultaneous and Costly Participation
- Stocking Retail Assortments Under Dynamic Consumer Substitution
- Inventory Competition Under Dynamic Consumer Choice
- Minimizing the Average Cost of Testing Coherent Systems: Complexity and Approximate Algorithms
- On the logic of theory change: Partial meet contraction and revision functions
- A Theory of Exit in Duopoly
- Correlated Equilibrium as an Expression of Bayesian Rationality
- Criteria for selecting a variable in the construction of efficient decision trees
- Reaching Agreement in the Presence of Faults
- Optimal Testing Procedures for Special Structures of Coherent Systems
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
- Learning read-once formulas with queries
- Technical Note—Fault Testing for a k-out-of-n System
- Optimistic fair exchange of digital signatures
- Optimal inspection and repair of renewable coherent systems with independent components and constant failure rates
- Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons
- A practical secret voting scheme for large scale elections
- Ranking Alternatives on the Basis of Preference Relations: A Progress Report with Special Emphasis on Outranking Relations
- Axiomatic Consensus Theory in Group Choice and Biomathematics
- A real-world MCDA application: evaluating software
- Approaches for Optimal Sequential Decision Analysis in Clinical Trials
- Decision Theoretic Designs for Phase II Clinical Trials with Multiple Outcomes
- Bayesian randomized clinical trials: A decision-theoretic sequential design
- An improved data stream summary: the count-min sketch and its applications
- An Envy-Free Cake Division Protocol
- A Fast Parametric Maximum Flow Algorithm and Applications
- Reaching a Consensus
- Merging Information Under Constraints: A Logical Framework
- 10.1162/1532443041827916
- Influence Diagrams for Causal Modelling and Inference
- Cooperation and Effective Computability
- Recent progresses in Multicriteria Decision-Aid
- An Impossibility Result in Axiomatic Location Theory
- Outranking Relations: Do They Have Special Properties?
- Coordination Complexity of Parallel Price-Directive Decomposition
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applications of approximation algorithms to cooperative games
- A large‐scale linear programming model for finding optimal container inspection strategies
- On the value of information in distributed decision-making (extended abstract)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Large Robust Games
- An axiomatic treatment of three qualitative decision criteria
- Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time
- Simple Binary Identification Problems
- Some Reliability Fault-Testing Models
- Fair Queuing and Other Probabilistic Allocation Methods
- Subset Comparisons for Additive Linear Orders
- Algorithms and Computation
- Aggregating inconsistent information
- LATIN 2004: Theoretical Informatics
- Measurement Theory
- The price of anarchy is independent of the network topology
- Expected qualitative utility maximization
- Learning in network contexts: experimental results from simulations
- Algorithmic mechanism design
- Principles and applications of continual computation
- Sharing the cost of multicast transmissions
- Nonmonotonic Choquet integrals
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- On decision-theoretic foundations for defaults
- Algorithm for optimal winner determination in combinatorial auctions
- Bargaining with limited computation: Deliberation equilibrium
- Planning and acting in partially observable stochastic domains
- Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
- A note on cake cutting
- A preference-based approach to spanning trees and shortest paths problems
- Efficient market-clearing prices in markets with nonconvexities
- Cooperation and bounded recall
- Evaluation and decision models with multiple criteria. Stepping stones for the analyst.
- Evaluation and decision models. A critical perspective
- Axioms for unique subjective probability on finite sets
- Merging relative scores
- Determining merged relative scores
- Interval graphs and interval orders
- How to select and how to rank projects: The PROMETHEE method
- An optimum testing algorithm for some symmetric coherent systems
- On scientific laws without dimensional constants
- Finite automata play the repeated prisoner's dilemma
- Applications of the theory of meaningfulness to psychology
- Equal or proportional division of a surplus, and other methods
- A note on strategy elimination in bimatrix games
- Repeated games with stationary bounded recall strategies
- Voting schemes for which it can be difficult to tell who won the election
- Functions computed by monotone Boolean formulas with no repeated variables
- On the possible merging functions
- Controlling backward inference
- Game theory and the Tennessee Valley Authority
- Nonmonotonic reasoning, preferential models and cumulative logics
- Characterizations of the plurality function
- On the indicator function of the plurality function
- Impediments to universal preference-based default theories
- On players with a bounded number of states
- Nash and correlated equilibria: Some complexity considerations
- Exploitation of a crisp relation in a ranking problem
- The complexity of computing a best response automaton in repeated games with mixed strategies
- The complexity of two-person zero-sum games in extensive form
- Bounded versus unbounded rationality: The tyranny of the weak
- Ranking methods based on valued preference relations. A characterization of the net flow method
- Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows
- How hard is it to control an election?
- Optimal problem-solving search: All-or-none solutions
- Constructing optimal binary decision trees is NP-complete
- An optimal sequence in multicharacteristic inspection
- Size bounds for dynamic monopolies
- Decentralized computation procurement and computational robustness in a smart market
- An improved general procedure for lexicographic bottleneck problems
- Nonmonotonic inference based on expectations
- Finitely many players with bounded recall in infinitely repeated games
- A computational theory of decision networks
- Question-asking strategies for Horn clause systems
- Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties
- Calibrated learning and correlated equilibrium
- Semiorders. Properties, representations, applications
- Modeling agents as qualitative decision makers
- Multicriteria filtering methods based on concordance and non-disordance principles
- The median procedure on median graphs
- Two-person repeated games with finite automata
- A near-optimal polynomial time algorithm for learning in certain classes of stochastic games
- Does optimization imply rationality?
- Possibilistic merging and distance-based fusion of propositional information
- Near-optimal reinforcement learning in polynomial time
- Equilibrium bid functions for auctions with an uncertain number of bidders
- On the evaluation of election outcomes under uncertainty
- A functional equation that arises in problems of scheduling with priorities and lateness/earliness penalties
- Boosting the margin: a new explanation for the effectiveness of voting methods
- A characterization of the Shapley value in queueing problems
- Finding mixed strategies with small supports in extensive form games
- Regret in the on-line decision problem
- Strategic entropy and complexity in repeated games
- The computational difficulty of manipulating an election
- Distributed probabilistic polling and applications to proportionate agreement
- On probabilistic rationing methods.
- Nontransitive decomposable conjoint measurement.
- A characterization of PQI interval orders.
- Propositional belief base merging or how to merge beliefs/goals coming from several sources and some links with social choice theory
- Auctions with bidder-determined allowable combinations
- On players' models of other players: Theory and experimental evidence
- Optimal amortized distributed consensus
- What is ceteris paribus preference?
- A sublinear-time randomized approximation algorithm for matrix games
- Towards qualitative approaches to multi-stage decision making
- Fuzzy measures and integrals. Theory and applications
- Repeated games with bounded entropy
- Artificial intelligence and Mathematics IX. Selected papers from the 5th international symposium, Fort Lauderdale, FL, USA, January 2--5, 1998
- The repeated insertion model for rankings: missing link between two subset choice models
- On periodical behaviour in societies with symmetric influences
- Consensus functions and patterns in molecular sequences
- Incremental cost sharing: Characterization by coalition strategy-proofness
- Side constraints and non-price attributes in markets
- Quiz show problems
- An admissible and optimal algorithm for searching AND/OR graphs
- Optimal task sequencing with precedence constraints
- Nonmonotonic Logics and Semantics
- The center function on trees
- On Envy-Free Cake Division
- Finitely Repeated Games with Finite Automata
- On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?
- Incentives, Decentralized Control, the Assignment of Joint Costs and Internal Pricing
- A Randomized Linear Programming Method for Computing Network Bid Prices
This page was built for publication: Computer science and decision theory
