Hasil untuk "Revenue. Taxation. Internal revenue"

William Troiani

We describe how finite colimits can be described using the internal lanuage, also known as the Mitchell-Benabou language, of a topos, provided the topos admits countably infinite colimits. This description is based on the set theoretic definitions of colimits and coequalisers, however the translation is not direct due to the differences between set theory and the internal language, these differences are described as internal versus external. Solutions to the hurdles which thus arise are given.

Louis Martini, Sebastian Wolf

We develop the theory of topoi internal to an arbitrary $\infty$-topos $\mathcal B$. We provide several characterisations of these, including an internal analogue of Lurie's characterisation of $\infty$-topoi, but also a description in terms of the underlying sheaves of $\infty$-categories, and we prove a number of structural results about these objects. Furthermore, we show that the $\infty$-category of topoi internal to $\mathcal B$ is equivalent to the $\infty$-category of $\infty$-topoi over $\mathcal B$, and use this result to derive a formula for the pullback of $\infty$-topoi. Lastly, we use our theory to relate smooth geometric morphisms of $\infty$-topoi to internal locally contractible topoi.

Kostya Druzhkov

A description of how the principle of stationary action reproduces itself in terms of the intrinsic geometry of variational equations is proposed. A notion of stationary points of an internal Lagrangian is introduced. A connection between symmetries, conservation laws and internal Lagrangians is established. Noether's theorem is formulated in terms of internal Lagrangians. A relation between non-degenerate Lagrangians and the corresponding internal Lagrangians is investigated. Several examples are discussed.

Nicolo Cesa-Bianchi, Roberto Colomboni, Maximilian Kasy

We consider the problem of repeatedly choosing policies to maximize social welfare. Welfare is a weighted sum of private utility and public revenue. Earlier outcomes inform later policies. Utility is not observed, but indirectly inferred. Response functions are learned through experimentation. We derive a lower bound on regret, and a matching adversarial upper bound for a variant of the Exp3 algorithm. Cumulative regret grows at a rate of $T^{2/3}$. This implies that (i) welfare maximization is harder than the multi-armed bandit problem (with a rate of $T^{1/2}$ for finite policy sets), and (ii) our algorithm achieves the optimal rate. For the stochastic setting, if social welfare is concave, we can achieve a rate of $T^{1/2}$ (for continuous policy sets), using a dyadic search algorithm. We analyze an extension to nonlinear income taxation, and sketch an extension to commodity taxation. We compare our setting to monopoly pricing (which is easier), and price setting for bilateral trade (which is harder).

Nelson Martins-Ferreira

An answer to the question investigated in this paper brings a new characterization of internal groupoids such that: (a) it holds even when finite limits are not assumed to exist; (b) it is a full subcategory of the category of involutive-2-links, that is, a category whose objects are morphisms equipped with a pair of interlinked involutions. This result highlights the fact that even thought internal groupoids are internal categories equipped with an involution, they can equivalently be seen as tri-graphs with an involution. Moreover, the structure of a tri-graph with an involution can be further contracted into a simpler structure consisting of one morphism with two interlinked involutions. This approach highly contrasts with the one where groupoids are seen as reflexive graphs on which a multiplicative structure is defined with inverses.

Ran Ben-Moshe, Sergiu Hart, Noam Nisan

Maximizing the revenue from selling two or more goods has been shown to require the use of $nonmonotonic$ mechanisms, where a higher-valuation buyer may pay less than a lower-valuation one. Here we show that the restriction to $monotonic$ mechanisms may not just lower the revenue, but may in fact yield only a $negligible$ $fraction$ of the maximal revenue; more precisely, the revenue from monotonic mechanisms is no more than k times the simple revenue obtainable by selling the goods separately, or bundled (where k is the number of goods), whereas the maximal revenue may be arbitrarily larger. We then study the class of monotonic mechanisms and its subclass of allocation-monotonic mechanisms, and obtain useful characterizations and revenue bounds.

Louis Martini, Sebastian Wolf

The goal of this article is to develop the theory of presentable categories and topoi internal to an arbitrary $\infty$-topos $\mathcal{B}$. Our main results are internal analogues of Lurie's and Lurie-Simpson's characterisations of presentable $\infty$-categories and $\infty$-topoi. In the process, we introduce a theory of internal filteredness and accessible internal categories and establish a number of structural results about presentable $\mathcal{B}$-categories such as adjoint functor theorems and the existence of an internal analogue of the Lurie tensor product. We also compare these internal notions with external variants. We show that $\mathcal{B}$-modules embed fully faithfully into presentable $\mathcal{B}$-categories and prove that there is an equivalence between topoi internal to $\mathcal{B}$ and $\infty$-topoi over $\mathcal{B}$. We also include a number of applications of our results, such as a general version of Diaconescu's theorem for $\infty$-topoi and a characterisation of locally contractible geometric morphisms in terms of smoothness.

Louis Martini

We develop some basic concepts in the theory of higher categories internal to an arbitrary $\infty$-topos. We define internal left and right fibrations and prove a version of the Grothendieck construction and of Yoneda's lemma for internal categories.

Maxime Crochemore, Costas Iliopoulos, Jakub Radoszewski et al.

Internal pattern matching requires one to answer queries about factors of a given string. Many results are known on answering internal period queries, asking for the periods of a given factor. In this paper we investigate (for the first time) internal queries asking for covers (also known as quasiperiods) of a given factor. We propose a data structure that answers such queries in $O(\log n \log \log n)$ time for the shortest cover and in $O(\log n (\log \log n)^2)$ time for a representation of all the covers, after $O(n \log n)$ time and space preprocessing.

Kyungduck Yoon, Shijie Qin, Siyao Shao et al.

Our study provides the first experimental investigation of the internal flows of ventilated partial cavitation (VPC) formed by air injection behind a backward-facing step. The experiments are conducted using flow visualization and planar particle image velocimetry (PIV) with fog particles for two different cavity regimes of VPC, i.e., open cavity (OC) and two-branch cavity (TBC), under various range of free stream velocity (U) and ventilation rates (Q). Our experiments reveal similar flow patterns for both OC and TBC, including forward flow region near the air-water interface, reverse flow region, near-cavitator vortex, and internal flow circulation vortex. However, OC internal flow exhibits highly unsteady internal flow features, while TBC internal flow shows laminar-like flow patterns with a Kelvin-Helmholtz instability developed at the interface between forward and reverse flow regions within the cavity. Internal flow patterns and the unsteadiness of OC resemble those of turbulent flow separation past a backward-facing step (BFS flow), suggesting a strong coupling of internal flow and turbulent external recirculation region for OC. Likewise, internal flow patterns of TBC resemble those of laminar BFS flow, with the presence of unsteadiness due to the strong velocity gradient across the forward-reverse flow interface. The variation of the internal flow upon changing U or Q is further employed to explain the cavity regime transition and the corresponding change of cavity geometry. Our study suggests that ventilation control can potentially stabilize the cavity in the TBC regime by delaying its internal flow regime transition from laminar-like to highly unsteady.

Léo Jimenez

In a stable theory, a stationary type $q \in S(A)$ internal to a family of partial types $\mathcal{P}$ over $A$ gives rise to a type-definable group, called its binding group. This group is isomorphic to the group $\mathrm{Aut}(q/\mathcal{P},A)$ of permutations of the set of realizations of $q$, induced by automorphisms of the monster model, fixing $\mathcal{P} \cup A$ pointwise. In this paper, we investigate families of internal types varying uniformly, what we will call relative internality. We prove that the binding groups also vary uniformly, and are the isotropy groups of a natural type-definable groupoid (and even more). We then investigate how properties of this groupoid are related to properties of the type. In particular, we obtain internality criteria for certain 2-analysable types, and a sufficient condition for a type to preserve internality.

P. -A. Jacqmin, S. Mantovani, G. Metere et al.

In order to deduce the internal version of the Brown exact sequence from the internal version of the Gabriel-Zisman exact sequence, we characterize fibrations and $\ast$-fibrations in the 2-category of internal groupoids in terms of the comparison functor from certain pullbacks to the corresponding strong homotopy pullbacks. A similar analysis in the category of arrows allows us to give a characterization of protomodular categories using strong homotopy kernels.

Huanyin Chen

A ring is SSP if the sum of two direct summands is a direct summand. A ring has internal cancellation if every its (von Neumann) regular elements are unit-regular. We show that in an SSP ring having internal cancellation, any regular element is special clean. Our main results also imply that for any SSP ring internal cancellation and idempotent stable range $1$ coincide with each other. Internal cancellation over SSP was then characterized by special clean elements.

Tomasz Brengos

In the first part of the paper we recall the coalgebraic approach to handling the so-called invisible transitions that appear in different state-based systems semantics. We claim that these transitions are always part of the unit of a certain monad. Hence, coalgebras with internal moves are exactly coalgebras over a monadic type. The rest of the paper is devoted to supporting our claim by studying two important behavioural equivalences for state-based systems with internal moves, namely: weak bisimulation and trace semantics. We continue our research on weak bisimulations for coalgebras over order enriched monads. The key notions used in this paper and proposed by us in our previous work are the notions of an order saturation monad and a saturator. A saturator operator can be intuitively understood as a reflexive, transitive closure operator. There are two approaches towards defining saturators for coalgebras with internal moves. Here, we give necessary conditions for them to yield the same notion of weak bisimulation. Finally, we propose a definition of trace semantics for coalgebras with silent moves via a uniform fixed point operator. We compare strong and weak bisimilation together with trace semantics for coalgebras with internal steps.

Saeed Alaei, Hu Fu, Nima Haghpanah et al.

The intuition that profit is optimized by maximizing marginal revenue is a guiding principle in microeconomics. In the classical auction theory for agents with linear utility and single-dimensional preferences, Bulow and Roberts (1989) show that the optimal auction of Myerson (1981) is in fact optimizing marginal revenue. In particular Myerson's virtual values are exactly the derivative of an appropriate revenue curve. This paper considers mechanism design in environments where the agents have multi-dimensional and non-linear preferences. Understanding good auctions for these environments is considered to be the main challenge in Bayesian optimal mechanism design. In these environments maximizing marginal revenue may not be optimal and there is sometimes no direct way to implement the marginal revenue maximization. Our contributions are three fold: we characterize the settings for which marginal revenue maximization is optimal (by identifying an important condition that we call revenue linearity), we give simple procedures for implementing marginal revenue maximization in general, and we show that marginal revenue maximization is approximately optimal. Our approximation factor smoothly degrades in a term that quantifies how far the environment is from ideal (where marginal revenue maximization is optimal). Because the marginal revenue mechanism is optimal for single-dimensional agents, our generalization immediately approximately extends many results for single-dimensional agents. One of the biggest open questions in Bayesian algorithmic mechanism design is developing methodologies that are not brute-force in the size of the agent type space. Our methods identify a subproblem that, e.g., for unit-demand agents with values drawn from product distributions, enables approximation mechanisms that are polynomial in the dimension.

Jiří Černý, Serguei Popov

We prove a shape theorem for the internal (graph) distance on the interlacement set $\mathcal{I}^u$ of the random interlacement model on $\mathbb Z^d$, $d\ge 3$. We provide large deviation estimates for the internal distance of distant points in this set, and use these estimates to study the internal distance on the range of a simple random walk on a discrete torus.

T. Georgopoulos

Monika Hornáčková

Benni Oktis Yanurwenda