The Oracle/PeopleSoft Case: Unilateral Effects, Simulation Models and Econometrics in Contemporary Merger Control

An increasingly important part of contemporary merger control both in the US and the EU is unilateral effects analysis, particularly with regard to oligopolistic mergers. In practice, this requires econometric analyses of past market data and, above all, the construction of simulation models in order to quantify the price effects in each specific case. The review of the merger between the software firms Oracle and PeopleSoft in 2003/04 has been the most important instance of parallel application of these sophisticated economic tools by the EU and US authorities so far. This makes an in-depth study of the case going from the controversial issue of market definition to the specificities of the competitive assessment worthwhile. Therefore, we highlight certain similarities as well as (minor) differences between the EU and US proceedings. Interestingly, despite serious initial concerns the transaction was not blocked nor even required to be modified in the two jurisdictions. We derive a number of interesting insights and, in particular, point out problems and lessons associated with the use of sophisticated economic tools in contemporary merger control. In addition to case-specific factors, the major insights encompass the continued relevance of market definition, the need to accompany predictive economic evidence with compatible reasoning and the benefits of including the economics of dynamic and evolutionary competition.Merger control, unilateral effects, econometric analysis, simulation models, market definition

The Oracle/PeopleSoft case: unilateral effects, simulation models and econometrics in contemporary merger control

An increasingly important part of contemporary merger control both in the US and the EU is unilateral effects analysis, particularly with regard to oligopolistic mergers. In practice, this requires econometric analyses of past market data and, above all, the construction of simulation models in order to quantify the price effects in each specific case. The review of the merger between the software firms Oracle and PeopleSoft in 2003/04 has been the most important instance of parallel application of these sophisticated economic tools by the EU and US authorities so far. This makes an in-depth study of the case going from the controversial issue of market definition to the specificities of the competitive assessment worthwhile. Therefore, we highlight certain similarities as well as (minor) differences between the EU and US proceedings. Interestingly, despite serious initial concerns the transaction was not blocked nor even required to be modified in the any of the two jurisdictions. We derive a number of interesting insights and, in particular, point out problems and lessons associated with the use of sophisticated economic tools in contemporary merger control. In addition to case-specific factors, the major insights encompass the continued relevance of market definition, the need to accompany predictive economic evidence with compatible reasoning and the benefits of including the economics of dynamic and evolutionary competition. --Merger control,unilateral effects,econometric analysis,simulation models,market definition

On attitude polarization under Bayesian learning with non-additive beliefs

Ample psychological evidence suggests that people’s learning behavior is often prone to a "myside bias" or "irrational belief persistence" in contrast to learning behavior exclusively based on objective data. In the context of Bayesian learning such a bias may result in diverging posterior beliefs and attitude polarization even if agents receive identical information. Such patterns cannot be explained by the standard model of rational Bayesian learning that implies convergent beliefs. As our key contribution, we therefore develop formal models of Bayesian learning with psychological bias as alternatives to rational Bayesian learning. We derive conditions under which beliefs may diverge in the learning process despite the fact that all agents observe the same - arbitrarily large - sample, which is drawn from an "objective" i.i.d. process. Furthermore, one of our learning scenarios results in attitude polarization even in the case of common priors. Key to our approach is the assumption of ambiguous beliefs that are formalized as non-additive probability measures arising in Choquet expected utility theory. As a specific feature of our approach, our models of Bayesian learning with psychological bias reduce to rational Bayesian learning in the absence of ambiguity.Non-additive Probability Measures, Choquet Expected Utility Theory, Bayesian Learning, Bounded Rationality

Group decision making via probabilistic belief merging

We propose a probabilistic-logical framework for group decision-making. Its main characteristic is that we derive group preferences from agents’ beliefs and utilities rather than from their individual preferences as done in social choice approaches. This can be more appropriate when the individual preferences hide too much of the individuals’ opinions that determined their preferences. We introduce three preference relations and investigate the relationships between the group preferences and in-dividual and subgroup preferences

Multicriteria sorting method based on global and local search for supplier segmentation

[EN] The aim of this research is to develop a robust multicriteria method to classify suppliers into ordered cate-gories and its validation in real contexts. The proposed technique is based on a property of net flows of thePROMETHEE method and uses global and local search concepts, which are common in the optimisationfield. The results obtained are compared to those from the most cited sorting algorithm, and an empiricalvalidation and sensitivity analysis is performed using real supplier evaluation data. Furthermore, it does notrequire additional information from decision-makers as other sorting algorithms do for assigning incompa-rable or indifferent alternatives to groups. An extension of the silhouette concept from data mining is alsocontributed to measure the quality of ordered classes. Both contributions are easy to apply and integrate intodecision support systems for automated decisions in the supply chain management. Finally, this practicalapproach is also useful to classify customers and any type of alternatives or actions into ordered categories,which have an increasing number of real applications.Barrera, F.; Segura Maroto, M.; Maroto Álvarez, MC. (2023). Multicriteria sorting method based on global and local search for supplier segmentation. International Transactions in Operational Research. 1-27. https://doi.org/10.1111/itor.1328812

On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs

A deterministic server is shared by users with identical linear waiting costs, requesting jobs of arbitrary lengths. Shortest jobs are served first for efficiency. The server can monitor the length of a job, but not the identity of its user, thus merging, splitting or partially transferring jobs offer cooperative strategic opportunities. Can we design cash transfers to neutralize such manipulations? We prove that merge-proofness and split-proofness are not compatible, and that it is similarly impossible to prevent all transfers of jobs involving three agents or more. On the other hand, robustness against pair-wise transfers is feasible, and essentially characterize a one-dimensional set of scheduling methods. This line is borne by two outstanding methods, the merge-proof S+ and the split-proof S?. Splitproofness, unlike Mergeproofness, is not compatible with several simple tests of equity. Thus the two properties are far from equally demanding.

Incentives for Experimenting Agents

We examine a repeated interaction between an agent, who undertakes experiments, and a principal who provides the requisite funding for these experiments. The agent’s actions are hidden, and the principal cannot commit to future actions. The repeated interaction gives rise to a dynamic agency cost -- the more lucrative is the agent’s stream of future rents following a failure, the more costly are current incentives for the agent. As a result, the principal may deliberately delay experimental funding, reducing the continuation value of the project and hence the agent’s current incentive costs. We characterize the set of recursive Markov equilibria. We also find that there are non-Markov equilibria that make the principal better off than the recursive Markov equilibrium, and that may make both agents better off. Efficient equilibria front-load the agent’s effort, inducing as much experimentation as possible over an initial period, until making a switch to the worst possible continuation equilibrium. The initial phase concentrates the agent’s effort near the beginning of the project, where it is most valuable, while the eventual switch to the worst continuation equilibrium attenuates the dynamic agency cost.Experimentation, Learning, Agency, Dynamic agency, Venture capital, Repeated principal-agent problem

The Role of preferences in logic programming: nonmonotonic reasoning, user preferences, decision under uncertainty

Intelligent systems that assist users in fulfilling complex tasks need a concise and processable representation of incomplete and uncertain information. In order to be able to choose among different options, these systems also need a compact and processable representation of the concept of preference. Preferences can provide an effective way to choose the best solutions to a given problem. These solutions can represent the most plausible states of the world when we model incomplete information, the most satisfactory states of the world when we express user preferences, or optimal decisions when we make decisions under uncertainty. Several domains, such as, reasoning under incomplete and uncertain information, user preference modeling, and qualitative decision making under uncertainty, have benefited from advances on preference representation. In the literature, several symbolic approaches of nonclassical reasoning have been proposed. Among them, logic programming under answer set semantics offers a good compromise between symbolic representation and computation of knowledge and several extensions for handling preferences. Nevertheless, there are still some open issues to be considered in logic programming. In nonmonotonic reasoning, first, most approaches assume that exceptions to logic program rules are already specified. However, sometimes, it is possible to consider implicit preferences based on the specificity of the rules to handle incomplete information. Secondly, the joint handling of exceptions and uncertainty has received little attention: when information is uncertain, the selection of default rules can be a matter of explicit preferences and uncertainty. In user preference modeling, although existing logic programming specifications allow to express user preferences which depend both on incomplete and contextual information, in some applications, some preferences in some context may be more important than others. Furthermore, more complex preference expressions need to be supported. In qualitative decision making under uncertainty, existing logic programming-based methodologies for making decisions seem to lack a satisfactory handling of preferences and uncertainty. The aim of this dissertation is twofold: 1) to tackle the role played by preferences in logic programming from different perspectives, and 2) to contribute to this novel field by proposing several frameworks and methods able to address the above issues. To this end, we will first show how preferences can be used to select default rules in logic programs in an implicit and explicit way. In particular, we propose (i) a method for selecting logic program rules based on specificity, and (ii) a framework for selecting uncertain default rules based on explicit preferences and the certainty of the rules. Then, we will see how user preferences can be modeled and processed in terms of a logic program (iii) in order to manage user profiles in a context-aware system and (iv) in order to propose a framework for the specification of nested (non-flat) preference expressions. Finally, in the attempt to bridge the gap between logic programming and qualitative decision under uncertainty, (v) we propose a classical- and a possibilistic-based logic programming methodology to compute an optimal decision when uncertainty and preferences are matters of degrees.Els sistemes intel.ligents que assisteixen a usuaris en la realització de tasques complexes necessiten una representació concisa i formal de la informació que permeti un raonament nomonòton en condicions d’incertesa. Per a poder escollir entre les diferents opcions, aquests sistemes solen necessitar una representació del concepte de preferència. Les preferències poden proporcionar una manera efectiva de triar entre les millors solucions a un problema. Aquestes solucions poden representar els estats del món més plausibles quan es tracta de modelar informació incompleta, els estats del món més satisfactori quan expressem preferències de l’usuari, o decisions òptimes quan estem parlant de presa de decisió incorporant incertesa. L’ús de les preferències ha beneficiat diferents dominis, com, el raonament en presència d’informació incompleta i incerta, el modelat de preferències d’usuari, i la presa de decisió sota incertesa. En la literatura, s’hi troben diferents aproximacions al raonament no clàssic basades en una representació simbòlica de la informació. Entre elles, l’enfocament de programació lògica, utilitzant la semàntica de answer set, ofereix una bona aproximació entre representació i processament simbòlic del coneixement, i diferents extensions per gestionar les preferències. No obstant això, en programació lògica es poden identificar diferents problemes pel que fa a la gestió de les preferències. Per exemple, en la majoria d’enfocaments de raonament no-monòton s’assumeix que les excepcions a default rules d’un programa lògic ja estan expressades. Però de vegades es poden considerar preferències implícites basades en l’especificitat de les regles per gestionar la informació incompleta. A més, quan la informació és també incerta, la selecció de default rules pot dependre de preferències explícites i de la incertesa. En el modelatge de preferències del usuari, encara que els formalismes existents basats en programació lògica permetin expressar preferències que depenen d’informació contextual i incompleta, en algunes aplicacions, donat un context, algunes preferències poden ser més importants que unes altres. Per tant, resulta d’interès un llenguatge que permeti capturar preferències més complexes. En la presa de decisions sota incertesa, les metodologies basades en programació lògica creades fins ara no ofereixen una solució del tot satisfactòria pel que fa a la gestió de les preferències i la incertesa. L’objectiu d’aquesta tesi és doble: 1) estudiar el paper de les preferències en la programació lògica des de diferents perspectives, i 2) contribuir a aquesta jove àrea d’investigació proposant diferents marcs teòrics i mètodes per abordar els problemes anteriorment citats. Per a aquest propòsit veurem com les preferències es poden utilitzar de manera implícita i explícita per a la selecció de default rules proposant: (i) un mètode basat en l’especificitat de les regles, que permeti seleccionar regles en un programa lògic; (ii) un marc teòric per a la selecció de default rules incertes basat en preferències explícites i la incertesa de les regles. També veurem com les preferències de l’usuari poden ser modelades i processades usant un enfocament de programació lògica (iii) que suporti la creació d’un mecanisme de gestió dels perfils dels usuaris en un sistema amb reconeixement del context; (iv) que permeti proposar un marc teòric capaç d’expressar preferències amb fòrmules imbricades. Per últim, amb l’objectiu de disminuir la distància entre programació lògica i la presa de decisió amb incertesa proposem (v) una metodologia basada en programació lògica clàssica i en una extensió de la programació lògica que incorpora lògica possibilística per modelar un problema de presa de decisions i per inferir una decisió òptima.Los sistemas inteligentes que asisten a usuarios en tareas complejas necesitan una representación concisa y procesable de la información que permita un razonamiento nomonótono e incierto. Para poder escoger entre las diferentes opciones, estos sistemas suelen necesitar una representación del concepto de preferencia. Las preferencias pueden proporcionar una manera efectiva para elegir entre las mejores soluciones a un problema. Dichas soluciones pueden representar los estados del mundo más plausibles cuando hablamos de representación de información incompleta, los estados del mundo más satisfactorios cuando hablamos de preferencias del usuario, o decisiones óptimas cuando estamos hablando de toma de decisión con incertidumbre. El uso de las preferencias ha beneficiado diferentes dominios, como, razonamiento en presencia de información incompleta e incierta, modelado de preferencias de usuario, y toma de decisión con incertidumbre. En la literatura, distintos enfoques simbólicos de razonamiento no clásico han sido creados. Entre ellos, la programación lógica con la semántica de answer set ofrece un buen acercamiento entre representación y procesamiento simbólico del conocimiento, y diferentes extensiones para manejar las preferencias. Sin embargo, en programación lógica se pueden identificar diferentes problemas con respecto al manejo de las preferencias. Por ejemplo, en la mayoría de enfoques de razonamiento no-monótono se asume que las excepciones a default rules de un programa lógico ya están expresadas. Pero, a veces se pueden considerar preferencias implícitas basadas en la especificidad de las reglas para manejar la información incompleta. Además, cuando la información es también incierta, la selección de default rules pueden depender de preferencias explícitas y de la incertidumbre. En el modelado de preferencias, aunque los formalismos existentes basados en programación lógica permitan expresar preferencias que dependen de información contextual e incompleta, in algunas aplicaciones, algunas preferencias en un contexto puede ser más importantes que otras. Por lo tanto, un lenguaje que permita capturar preferencias más complejas es deseable. En la toma de decisiones con incertidumbre, las metodologías basadas en programación lógica creadas hasta ahora no ofrecen una solución del todo satisfactoria al manejo de las preferencias y la incertidumbre. El objectivo de esta tesis es doble: 1) estudiar el rol de las preferencias en programación lógica desde diferentes perspectivas, y 2) contribuir a esta joven área de investigación proponiendo diferentes marcos teóricos y métodos para abordar los problemas anteriormente citados. Para este propósito veremos como las preferencias pueden ser usadas de manera implícita y explícita para la selección de default rules proponiendo: (i) un método para seleccionar reglas en un programa basado en la especificad de las reglas; (ii) un marco teórico para la selección de default rules basado en preferencias explícitas y incertidumbre. También veremos como las preferencias del usuario pueden ser modeladas y procesadas usando un enfoque de programación lógica (iii) para crear un mecanismo de manejo de los perfiles de los usuarios en un sistema con reconocimiento del contexto; (iv) para crear un marco teórico capaz de expresar preferencias con formulas anidadas. Por último, con el objetivo de disminuir la distancia entre programación lógica y la toma de decisión con incertidumbre proponemos (v) una metodología para modelar un problema de toma de decisiones y para inferir una decisión óptima usando un enfoque de programación lógica clásica y uno de programación lógica extendida con lógica posibilística.Sistemi intelligenti, destinati a fornire supporto agli utenti in processi decisionali complessi, richiedono una rappresentazione dell’informazione concisa, formale e che permetta di ragionare in maniera non monotona e incerta. Per poter scegliere tra le diverse opzioni, tali sistemi hanno bisogno di disporre di una rappresentazione del concetto di preferenza altrettanto concisa e formale. Le preferenze offrono una maniera efficace per scegliere le miglior soluzioni di un problema. Tali soluzioni possono rappresentare gli stati del mondo più credibili quando si tratta di ragionamento non monotono, gli stati del mondo più soddisfacenti quando si tratta delle preferenze degli utenti, o le decisioni migliori quando prendiamo una decisione in condizioni di incertezza. Diversi domini come ad esempio il ragionamento non monotono e incerto, la strutturazione del profilo utente, e i modelli di decisione in condizioni d’incertezza hanno tratto beneficio dalla rappresentazione delle preferenze. Nella bibliografia disponibile si possono incontrare diversi approcci simbolici al ragionamento non classico. Tra questi, la programmazione logica con answer set semantics offre un buon compromesso tra rappresentazione simbolica e processamento dell’informazione, e diversi estensioni per la gestione delle preferenze sono state proposti in tal senso. Nonostante ció, nella programmazione logica esistono ancora delle problematiche aperte. Prima di tutto, nella maggior parte degli approcci al ragionamento non monotono, si suppone che nel programma le eccezioni alle regole siano già specificate. Tuttavia, a volte per trattare l’informazione incompleta è possibile prendere in considerazione preferenze implicite basate sulla specificità delle regole. In secondo luogo, la gestione congiunta di eccezioni e incertezza ha avuto scarsa attenzione: quando l’informazione è incerta, la scelta di default rule può essere una questione di preferenze esplicite e d’incertezza allo stesso tempo. Nella creazione di preferenze dell’utente, anche se le specifiche di programmazione logica esistenti permettono di esprimere preferenze che dipendono sia da un’informazione incompleta che da una contestuale, in alcune applicazioni talune preferenze possono essere più importanti di altre, o espressioni più complesse devono essere supportate. In un processo decisionale con incertezza, le metodologie basate sulla programmazione logica viste sinora, non offrono una gestione soddisfacente delle preferenze e dell’incertezza. Lo scopo di questa dissertazione è doppio: 1) chiarire il ruolo che le preferenze giocano nella programmazione logica da diverse prospettive e 2) contribuire proponendo in questo nuovo settore di ricerca, diversi framework e metodi in grado di affrontare le citate problematiche. Per prima cosa, dimostreremo come le preferenze possono essere usate per selezionare default rule in un programma in maniera implicita ed esplicita. In particolare proporremo: (i) un metodo per la selezione delle regole di un programma logico basato sulla specificità dell’informazione; (ii) un framework per la selezione di default rule basato sulle preferenze esplicite e sull’incertezza associata alle regole del programma. Poi, vedremo come le preferenze degli utenti possono essere modellate attraverso un programma logico, (iii) per creare il profilo dell’utente in un sistema context-aware, e (iv) per proporre un framework che supporti la definizione di preferenze complesse. Infine, per colmare le lacune in programmazione logica applicata a un processo di decisione con incertezza (v) proporremo una metodologia basata sulla programmazione logica classica e una metodologia basata su un’estensione della programmazione logica con logica possibilistica

An axiomatic model of 'cold feet'

Individuals often lose confidence in their prospects as they approach the "moment of truth." An axiomatic model of such individuals is provided. The model adapts and extends (by relaxing the Independence axiom) Gul and Pesendorfer's model of temptation and self-control to capture an individual who changes her beliefs so as to become more pessimistic as payoff time approaches. In a variation of the model, the individual becomes more optimistic at an ex post stage in order to feel better about her available options.pessimism, optimism, cold feet, temptation, self-control, moment of truth, temporal proximity, confidence