Search results for " Program"

showing 10 items of 3075 documents

LeSSS: Learned Shared Semantic Spaces for Relating Multi-Modal Representations of 3D Shapes

2015

In this paper, we propose a new method for structuring multi-modal representations of shapes according to semantic relations. We learn a metric that links semantically similar objects represented in different modalities. First, 3D-shapes are associated with textual labels by learning how textual attributes are related to the observed geometry. Correlations between similar labels are captured by simultaneously embedding labels and shape descriptors into a common latent space in which an inner product corresponds to similarity. The mapping is learned robustly by optimizing a rank-based loss function under a sparseness prior for the spectrum of the matrix of all classifiers. Second, we extend …

Theoretical computer sciencebusiness.industryComputer scienceRank (computer programming)Cognitive neuroscience of visual object recognitioncomputer.software_genreComputer Graphics and Computer-Aided DesignProduct (mathematics)Similarity (psychology)Line (geometry)Metric (mathematics)Collaborative filteringEmbeddingArtificial intelligencebusinesscomputerNatural language processingComputer Graphics Forum
researchProduct

A Logic of Discovery

1998

A logic of discovery is introduced. In this logic, true sentences are discovered over time based on arriving data. A notion of expectation is introduced to reflect the growing certainty that a universally quantified sentence is true as more true instances are observed. The logic is shown to be consistent and complete. Monadic predicates are considered as a special case

TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTheoretical computer scienceComputer sciencebusiness.industrymedia_common.quotation_subjectArtificial intelligenceSpecial caseCertaintyMonad (functional programming)businessPredicate (grammar)Sentencemedia_common
researchProduct

Consensus in Noncooperative Dynamic Games: a Multi-Retailer Inventory Application

2008

We focus on Nash equilibria and Pareto optimal Nash equilibria for a finite horizon noncooperative dynamic game with a special structure of the stage cost. We study the existence of these solutions by proving that the game is a potential game. For the single-stage version of the game, we characterize the aforementioned solutions and derive a consensus protocol that makes the players converge to the unique Pareto optimal Nash equilibrium. Such an equilibrium guarantees the interests of the players and is also social optimal in the set of Nash equilibria. For the multistage version of the game, we present an algorithm that converges to Nash equilibria, unfortunately, not necessarily Pareto op…

TheoryofComputation_MISCELLANEOUSComputer Science::Computer Science and Game TheoryCorrelated equilibriumSequential gameComputer scienceDynamic programmingSubgame perfect equilibriumsymbols.namesakeCoordination gameElectrical and Electronic EngineeringRisk dominanceFolk theoremPrice of stabilityNon-credible threatGame theoryCentipede gameImplementation theoryNon-cooperative gameInventoryNormal-form gameStochastic gameComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALComputer Science ApplicationsConsensus protocols; Dynamic programming; Game theory; InventoryConsensus protocolsZero-sum gameControl and Systems EngineeringNash equilibriumEquilibrium selectionBest responsesymbolsRepeated gameEpsilon-equilibriumConsensus protocols; Dynamic programming; Game theory; Inventory;Potential gameSolution conceptMathematical economicsGame theory
researchProduct

Identification of efficient equilibria in multiproduct trading with indivisibilities and non-monotonicity

2018

Abstract This paper focuses on multiproduct trading with indivisibilities and where a representative agent may have non-monotonic preferences. In this framework, the set of firms’ profits (which comes from efficient subgame perfect Nash equilibria) is the Pareto frontier of some projection of the core of the game. We show that under monotonicity efficient subgame perfect Nash equilibria are achieved by single offers and the equilibrium characterization is easy to obtain. When dealing with non-monotonic preferences the problem becomes more challenging. Then, we define a pair of primal–dual linear programming problems that fully identifies the core of the game. A set of modified versions of t…

TheoryofComputation_MISCELLANEOUSComputer Science::Computer Science and Game TheoryEconomics and Econometrics021103 operations researchLinear programmingComputer scienceApplied Mathematics05 social sciences0211 other engineering and technologiesPareto principleTheoryofComputation_GENERAL02 engineering and technologyRepresentative agentSubgame perfect equilibriumDual (category theory)symbols.namesakeCore (game theory)Strong Nash equilibriumNash equilibrium0502 economics and businesssymbolsMathematical economics050205 econometrics Journal of Mathematical Economics
researchProduct

Noncooperative dynamic games for inventory applications: A consensus approach

2008

We focus on a finite horizon noncooperative dynamic game where the stage cost of a single player associated to a decision is a monotonically nonincreasing function of the total number of players making the same decision. For the single-stage version of the game, we characterize Nash equilibria and derive a consensus protocol that makes the players converge to the unique Pareto optimal Nash equilibrium. Such an equilibrium guarantees the interests of the players and is also social optimal in the set of Nash equilibria. For the multi-stage version of the game, we present an algorithm that converges to Nash equilibria, unfortunately not necessarily Pareto optimal. The algorithm returns a seque…

TheoryofComputation_MISCELLANEOUSDynamic gamesComputer Science::Computer Science and Game TheoryMathematical optimizationCorrelated equilibriumSequential gameConsensus ProtocolsComputer scienceA-priori; Consensus protocols; Dynamic games; Finite horizons; Inventory; Inventory systems; Joint decisions; Multi stages; Nash equilibrium; Pareto-optimal; Single stages; Unilateral improvementsSymmetric equilibriumOutcome (game theory)Joint decisionsNash equilibriumFinite horizonsMulti stagessymbols.namesakeBayesian gameSettore ING-INF/04 - AutomaticaPareto-optimalA-prioriCoordination gameFolk theoremPrice of stabilityRisk dominanceNon-credible threatConsensus Protocols Dynamic Programming Game Theory InventoryInventory systemsTraveler's dilemmaNormal-form gameStochastic gameInventoryComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALMinimaxConsensus protocolsEquilibrium selectionNash equilibriumBest responseSingle stagesRepeated gamesymbolsEpsilon-equilibriumSettore MAT/09 - Ricerca OperativaSolution conceptDynamic Programming Game TheoryUnilateral improvementsMathematical economicsGame theoryConsensus Protocols; Dynamic Programming Game Theory; Inventory
researchProduct

NASH EQUILIBRIA IN A MODEL OF MULTIPRODUCT PRICE COMPETITION: AN ASSIGNMENT PROBLEM

2003

We study the market interaction of a finite number of single-product firms and a representative buyer, where the buyer consumes bundles of these goods. The buyers' value function determines their willingness to pay for subsets of goods. We show that subgame perfect Nash-equilibrium outcomes are solutions of the linear relaxation of an integer programming assignment problem and that they always exits. The (subgame perfect) Nash-equilibrium price set is characterized by the Pareto frontier of the associated dual problem's projection on the firms' price vectors. We identify the Nash-equilibrium prices for monotonic buyers' value functions and, more importantly, we show that some central soluti…

TheoryofComputation_MISCELLANEOUSEconomics and EconometricsComputer Science::Computer Science and Game TheoryApplied Mathematicsjel:D41jel:D72TheoryofComputation_GENERALCooperative game theoryjel:D21jel:D43Extensive-form gameSubgame perfect equilibriumCompetition (economics)Microeconomicssymbols.namesakeMarkov perfect equilibriumSubgameNash equilibriumMultiproduct price competition interger programming subgame perfect nash equilibriaStackelberg competitionEconomicssymbolsMathematical economics
researchProduct

MIXED OLIGOPOLY, PRODUCT DIFFERENTIATION AND COMPETITION FOR PUBLIC TRANSPORT SERVICES*

2006

This paper explores frequency and pricing decisions in a horizontally and vertically differentiated duopoly when there is competition between means of transport and where one of the firms need not necessarily maximize profits. The private and the mixed duopoly are compared and distortions from the social optimum are identified, both analytically and numerically. A mixed duopoly does not recover the socially optimal solution. However, the presence of a (public) non-profit maximizing operator is a useful measure to get closer to the social optimum. When both operators are (private) profit maximizers, some control measures such as price caps and minimum service availability would reduce the di…

TheoryofComputation_MISCELLANEOUSEconomics and EconometricsMixed duopolybusiness.industryProduct differentiationProfit (economics)MicroeconomicsOligopolyOperator (computer programming)Public transportEconomicsbusinessSocial optimumDuopolyIndustrial organizationThe Manchester School
researchProduct

An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems

1984

We propose new alternative theorems for convex infinite systems which constitute the generalization of the corresponding toGale, Farkas, Gordan andMotzkin. By means of these powerful results we establish new approaches to the Theory of Infinite Linear Inequality Systems, Perfect Duality, Semi-infinite Games and Optimality Theory for non-differentiable convex Semi-Infinite Programming Problem.

TheoryofComputation_MISCELLANEOUSStatistics and ProbabilityConvex analysisDiscrete mathematicsGeneralizationLinear matrix inequalityRegular polygonDuality (optimization)Optimality theorySemi-infinite programmingAlgebraLinear inequalityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESStatistics Probability and UncertaintyMathematicsTrabajos de Estadistica y de Investigacion Operativa
researchProduct

Analyses of the TRACE V5 capability for the simulation of natural circulation and primary/containment coupling in BDBA condition typical of the MASLWR

2014

In the short term period the use of advanced Small Modular Reactor (SMR) is one of the most promising options for the deployment of nuclear technology. The validation and assessment of the best estimate thermal hydraulic system code TRACE against SMR thermal hydraulic phenomena is a novel effort. In this framework the use of the natural circulation database developed at the OSU-MASLWR test facility, simulating the MASLWR reactor prototype, is of interest for analyses of the TRACE code capability in predicting natural circulation and primary/containment coupled behavior in SMR. The target of this paper is to analyze the TRACE V5 capability for the simulation of natural circulation phenomena,…

Thermal hydraulicsEngineeringNatural circulationPrimary (chemistry)ContainmentCoupling (computer programming)business.industryNuclear engineeringMass flow ratebusinessSimulationTRACE (psycholinguistics)Small modular reactor
researchProduct

Civilprocesa programma: sastādīta pēc 1932./33. mācības gadā Latvijas Universitātē lasītām lekcijām

1933

Tiesvedība - studiju programmaProceedingsHistory of lawCivilprocesuālās tiesības - studiju programma:LAW/JURISPRUDENCE::Procedural law::Civil procedure [Research Subject Categories]Tiesību vēsture - studiju programmaLatvijas Universitātes vēstureCivilprocess - studiju programma
researchProduct