In this paper, we study a variant of hedonic games called \textsc{SeatArrangement}. The model is defined by a bijection from agents with preferencesto vertices in a graph . We investigate the computational complexity of problems to find certain “good” seat arrangements .…

## A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions

We prove two new results about the randomized query complexity of composedfunctions . First, we show that the randomized composition conjecture is false . We show that for all $f$ and $g$, $R(f\circg))=\Omega(\mathop{noisyR}(f)$ is ameasure describing the cost of computing $f on noisy oracle inputs .…

## A New Minimax Theorem for Randomized Algorithms

The celebrated minimax principle of Yao (1977) says that for anyBoolean-valued function $f$ with finite domain, there is a distribution $mu$ that works for all bias levels at once . We show that this works for randomized query complexity, randomized communicationcomplexity, some randomized circuit models, quantum query and communicationcomplexities, approximate polynomial degree, and approximate logrank .…

## The Power of Many Samples in Query Complexity

The randomized query complexity of a function $R(f)$ is characterized by the least number of queries needed to distinguish a distribution $D_0$ over $0$- inputs . We show there exists a hard pair of pairs $(D__0,D_1)$ that requires many queries .…

## Near Optimal Task Graph Scheduling with Priced Timed Automata and Priced Timed Markov Decision Processes

Task graph scheduling suffers from acombinatorial explosion and thus finding optimal schedulers is a difficult task . The task graph schedulingproblem is reduced to location reachability via the fastest path in PricedTimed Automata (PTA) and Priced Timed Markov Decision Processes (PTMDP) We conduct an exhaustive experimental evaluation where we compare our resulting schedules with the best-known schedules of a state of the art tool .…

## G 1 hole filling with S patches made easy

S-patches have been around for 30 years, but they are seldom used, and are considered more of a mathematical curiosity than a practical surface representation . In this article a method is presented for automatically creating S-Patches of any degree or any number of sides, suitable for inclusion in a curve network with tangential continuity to the adjacent surfaces .…

## Audio driven Talking Face Video Generation with Learning based Personalized Head Pose

Real-world talking faces often accompany with natural head movement . Most existing talking face video generation methods only consider facialanimation with fixed head pose . Most challenging issue in our work is that natural poses often cause in-plane and out-of-plane head rotations .…

## Implicit Geometric Regularization for Learning Shapes

Representing shapes as level sets of neural networks has been recently proved useful for different shape analysis and reconstruction tasks . So far, such representations were computed using either: (i) pre-computed implicitshape representations; or (ii) loss functions explicitly defined over theneural level sets .…

## Dynamic Incentive aware Learning Robust Pricing in Contextual Auctions

Buyers’ valuations for an item depend on the context that describes the item . Seller’s goal is to design a learning policy to set reserve prices via observing the past sales data . Sellers’ objective is to minimize her regret for revenue, where the regret is computed against a clairvoyant policy that knows buyers’ heterogeneous preferences .…

## FairRec Two Sided Fairness for Personalized Recommendations in Two Sided Platforms

We investigate the problem of fair recommendation in the context of two-sided online platforms, comprising customers on one side and producers on the other . We consider fairness issues that span both customers and producers . Our proposed FairRec algorithm guarantees at least Maximin Share (MMS) of exposure for most of the producers and Envy-Free up to One item (EF1) fairness for everycustomer.…

## Double Spend Counterattacks Threat of Retaliation in Proof of Work Systems

Proof-of-Work mining is intended to provide blockchains with robustness against double-spend attacks . However, an economic analysis suggests that the resulting rewards can make an attack cheap . We formalize a defense to double spend attacks . We show that when the victim can counterattack in the same way as the attacker, this leads to a variation on the classic game-theoretic War of attrition model .…

## Fair and Truthful Mechanisms for Dichotomous Valuations

We focus on valuationsthat have dichotomous marginals, in which the added value of any item to a setis either 0 or 1 . We aim to design truthful allocation mechanisms (without money) that maximize welfare and are fair . We then show that our mechanism withrandom priorities is envy-free ex-ante, while having all the above propertiesex-post .…

## Binary Scoring Rules that Incentivize Precision

All proper scoring rules incentivize an expert to predict accurately, but not all are equally incentivized . We use a model where a rational expert can endogenously refine their belief by repeatedly paying a fixed cost . We also consider extensions to minimize the moment of error .…

## Inducing Equilibria in Networked Public Goods Games through Network Structure Modification

Networked public goods games model scenarios in which self-interested agents decide whether or how much to invest in an action that benefits their network neighbors . Examples include vaccination, security investment, and crime reporting . We show that the problem is NP-complete for a number of scenarios, but we exhibit a broadarray of scenarios where the problem can be solved in polynomial time by reducing the problem to (minimum-cost) matching problems .…

## Weighted PCL over product valuation monoids

We introduce a weighted propositional configuration logic over a productvaluation monoid . Our logic is intended to serve as a specification language for software architecture with quantitative features such as the average of interactions’ costs of the architecture . We provide formulas of our logic which describe well-knownarchitectures equipped with quantitative characteristics .…

## Failure Trace Semantics for a Process Algebra with Time outs

This paper extends a standard process algebra with a time-out operator . It increases its absolute expressiveness, while remaining within therealm of untimed process algebra, in the sense that the progress of time is notquantified . Trace and failures equivalence fail to be congruences for this operator .…

## A Type Checker for a Logical Framework with Union and Intersection Types

Bull is a prototypetheorem prover based on the Delta-Framework, i.e. a fully-typed lambda-calculus decorated with union and intersection types . Bull implements a subtyping algorithm for the Type Theory Xiof Barbanera-Dezani-de’Liguoro . Bull uses a higher-order unification algorithm for terms, while typechecking and partial type inference are done by abidirectional refinement algorithm, similar to the one found in Matita andBeluga .…

## Degrees of incomputability realizability and constructive reverse mathematics

In our setting, we make use of Weihrauch degrees (degrees ofincomputability/discontinuity of partial multi-valued functions) to obtainLifschitz-like relative realizability predicates . In this note, we present examples on how to lift some separation results on Weihrah degrees to those over intuitionistic Zermelo-Fraenkel set theory .…

## Distributed Algorithms for Composite Optimization Unified Framework and Convergence Analysis

We study distributed composite optimization over networks: agents minimize asum of smooth (strongly) convex functions, the agents’ sum-utility, plus anonsmooth (extended-valued) conveX one . We propose a general unifiedalgorithmic framework for such a class of problems and provide a unifiedconvergence analysis leveraging the theory of operator splitting .…

## RMB DPOP Refining MB DPOP by Reducing Redundant Inferences

MB-DPOP is an important complete algorithm for solving Distributed ConstraintOptimization Problems . Each cluster root in the algorithm is responsible for enumerating all the instantiations of its cycle-cut nodes . This would cause redundant inferences when its branches don’t have the same nodes .…

## Model Watermarking for Image Processing Networks

Deep learning has achieved tremendous success in numerous industrial applications . However, these valuable deep models are exposed to a huge risk ofinfringements . How toprotect the intellectual property of deep models is a very important butseriously under-researched problem . In this paper, we propose the firstmodel watermarking framework for protecting image processing models .…

## DDet Dual path Dynamic Enhancement Network for Real World Image Super Resolution

Real-SR focus on relationship between real-worldhigh-resolution(HR) and low-resolution (LR) image . Most of the traditional imageSR obtains the LR sample by applying a fixed down-sampling operator . In this article, we propose a Dual-path Dynamic Enhancement Network(DDet), which addresses the cross-camera image mapping by realizing a dual-way dynamicsub-pixel weighted aggregation and refinement .…

## Model based Joint Bit Allocation between Geometry and Color for Video based 3D Point Cloud Compression

Rate distortion optimization plays a very important role in image/videocoding . In thispaper, the rate and distortion characteristics of 3D point cloud are investigated in detail . To maximize the reconstructed quality of the reconstructed 3Dpoint cloud, the bit allocation problem is formulated as a constrainedoptimization problem and solved by an interior point method .…

## Human Perception Optimized Planning for Comfortable VR Based Telepresence

This paper introduces an emerging motion planning problem by considering a human that is immersed into the viewing perspective of a remote robot . The challenge is to make the experience both effective (such as delivering a senseof presence) and comfortable .…

## A Comparative Evaluation of Temporal Pooling Methods for Blind Video Quality Assessment

Many objective video quality assessment (VQA) algorithms include a key step of temporal pooling of frame-level quality scores . Less attention has been paid to studying the relative efficiencies of different pooling methods on no-reference (blind) VQA . Here we conduct a large-scale comparative evaluation to assess the capabilities and limitations of multiple methods .…

## Toward Predicting Success and Failure in CS2 A Mixed Method Analysis

Both CS1 and CS2 at the University of North Carolina Wilmington (UNCW) are taught in Python with annualenrollments of 300 and 150 respectively . We find that 56% of students’ grades were lower in CS2than CS1, 18% improved their grades, and 26% earned the same grade .…

## Engaging Users through Social Media in Public Libraries

The participatory library is an emerging concept which refers to the ideathat an integrated library system must allow users to take part in core functions of the library rather than engaging on the periphery . To embrace theparticipatory idea, libraries have employed many technologies, such as socialmedia to help them build participatory services and engage users .…

## LibrettOS A Dynamically Adaptable Multiserver Library OS

LibrettOS fuses two paradigms to simultaneously address issues of isolation, performance, compatibility, failurerecoverability, and run-time upgrades . The OS acts as a microkernel OS that runs servers in an isolated manner . It can also act as a library OS when applications are granted exclusive access to virtual hardware resources such as storage and networking .…

## MLIR A Compiler Infrastructure for the End of Moore s Law

MLIR aims to address software fragmentation, improve compilation for heterogeneous hardware, significantly reduce the cost of building domain specific compilers, and aid in connecting existing compilers . MLIR facilitates the design and implementation of code generators,translators and optimizers at different levels of abstraction and also across application domains, hardware targets and execution environments .…

## Security Wrappers for Information Flow Control in Active Object Languages with Futures

This paper introduces a run-time mechanism for preventing leakage of secure information in distributed systems . The aim is to prevent leakage of confidential information to low-level viewers . The approach is based on the notion of a security wrapper, whichencloses an object or a component and controls its interactions with theenvironment .…

## On the complexity of zero gap MIP

The class $\mathsf{MIP}^*$ is the set of languages decidable by multiproverinteractive proofs with quantum entangled provers . In this paper we investigate the complexity of deciding whether the quantumvalue of a non-local game $G$ is exactly $1$ This problem corresponds to acomplexity class that we call zero gap $MIP##$ .…

## Fast In place Algorithms for Polynomial Operations Division Evaluation Interpolation

We consider space-saving versions of several important operations onunivariate polynomials . We demonstrate new in-place algorithms for theaforementioned polynomial computations which require only constant extra space . We also provide a precise complexity analysis so that allconstants are made explicit, parameterized by the space usage of the underlyingmultiplication algorithms .…

## Lower bounds for prams over Z

Paper presents a new abstract method for proving lower bounds incomputational complexity . Based on the notion of topological entropy fordynamical systems, the method captures four previous lower bounds results from the literature in algebraic complexity . Among these results lies Mulmuley’s proof that “prams without bit operations” do not compute the maxflow problem inpolylogarithmic time .…

## Hardness of equations over finite solvable groups under the exponential time hypothesis

Goldmann and Russell (2002) initiated the study of the complexity of theequation satisfiability problem in finite groups by showing that it is in P fornilpotent groups . Since then,several results have appeared showing that the problem can be solved inpolynomial time in certain solvable groups of Fitting length two .…

## Wheeler Languages

Wheeler graphs are inspired by the Burrows-Wheeler Transform (BWT) of a given string . They admit an efficient index data structure for searching for subpaths with a given path label . We study languages accepted by automata having aWheeler graph as transition function .…

## PolyGen An Autoregressive Generative Model of 3D Meshes

Polygon meshes are an efficient representation of 3D geometry, and are of central importance in computer graphics, robotics and games development . We present an approach which models the mesh directly, predicting mesh vertices and faces . Our model can condition on a range of inputs, including object classes, voxels, and images, and can produce samples that capture uncertainty in ambiguous scenarios .…

## Image Stylization From Predefined to Personalized

We present a framework for interactive design of new image stylizations using a wide range of predefined filter blocks . Both novel and off-the-shelf imagefiltering and rendering techniques are extended and combined to allow the userto unleash their creativity to invent, modify, and tune new styles .…

## Equitable Allocations of Indivisible Chores

We study fair allocation of indivisible chores among agents with additive valuations . An allocation is deemed fair if it is (approximately) equitable, which means that the disutilities of the agents are (about) equal . We show that there always exists an allocation that is simultaneously equitable up toone chore (EQ1) and Pareto optimal (PO) Our experiments on synthetic as well as real-world data show that the algorithms considered in ourwork satisfy approximate fairness and efficiency properties significantly more often than the algorithm currently deployed on Spliddit.…

## Efficient exploration of zero sum stochastic games

We investigate the increasingly important and common game-solving setting where we do not have an explicit description of the game but only oracle accessto it through gameplay . We propose using the distribution of state-action value functions induced by a belief distribution over possible environments .…

## Spatial Temporal Moving Target Defense A Markov Stackelberg Game Model

Moving target defense has emerged as a critical paradigm of protecting avulnerable system against persistent and stealthy attacks . To protect a system, a defender proactively changes the system configurations to limit the exposure of security vulnerabilities to potential attackers .…

## A Probabilistic Approach to Voting Allocation Matching and Coalition Formation

Randomisation and time-sharing are some of the oldest methods to achieve fairness . I make a case that applying these approaches to social choicesettings constitutes a powerful paradigm that deserves an extensive and thorough examination . I discuss challenges and opportunities in applying theseapproaches to settings including voting, allocation, matching, and coalitionformation .…

## Optimal Advertising for Information Products

When selling information, sometimes the seller can increase the revenue by giving away some partial information to change the buyers’ belief about the product . This workstudies the general problem of advertising information products by revealingsome partial information . The seller’s goal is to maximize the expected revenue .…

## Facets of the PIE Environment for Proving Interpolating and Eliminating on the Basis of First Order Logic

PIE is a Prolog-embedded environment for automated reasoning on the basis offirst-order logic . Its main focus is on formulas, as constituents of complexformalizations that are structured through formula macros . It supports a workflow based on documents that intersperse macrodefinitions, invocations of reasoners, and LaTeX-formatted natural languagetext .…

## Complex Markov Logic Networks Expressivity and Liftability

We study expressivity of Markov logic networks (MLNs) We show that, unlike standard MLNswith real-valued weights, complex MLNs are fully expressive . We then observe that discrete Fourier transform can be computed using weighted first ordermodel counting (WFOMC) with complex weights .…

## A Mechanised Semantics for HOL with Ad hoc Overloading

Isabelle/HOL augments classical higher-order logic with ad-hoc overloading ofconstant definitions . One constant may have several definitions for non-overlapping types . In this paper, we present a mechanised proof that HOLis consistent . All results have been formalised inthe HOL4 theorem prover .…

## Scalable Multi Agent Inverse Reinforcement Learning via Actor Attention Critic

Multi-agent adversarial inverse reinforcement learning (MA-AIRL) is a recent approach that applies single-agent AIRL to multi-agent problems where we seek to recover both policies for our agents and reward functions that promoteexpert-like behavior . While MA-AIRl has promising results on cooperative andcompetitive tasks, it is sample-inefficient and has only been validatedempirically for small numbers of agents — its ability to scale to many agents remains an open question .…

## Bio inspired Optimization metaheuristic algorithms for optimization

In today’s day and time solving real-world complex problems has become vital and critical task . Many of these are combinatorial problems, where optimal solutions are sought rather than exact solutions . Last two decades have seen many new methods in AI based on the characteristics and behaviors of the living organisms in thenature which are categorized as bio-inspired or nature inspired optimizational algorithms .…

## iLQGames jl Rapidly Designing and Solving Differential Games in Julia

iLQGames.jl is a framework fordesigning and solving differential games, built around the iterativelinear-quadratic method . It is written in the Julia programming language to allow flexible prototyping and integration with other research software . The open-source software package can be found athttps://://://github.com/lassepe/iLQGame.jl.jl…

## Optimal strategies in the Fighting Fantasy gaming system influencing stochastic dynamics by gambling with limited resource

Fighting Fantasy is a popular recreational fantasy gaming system worldwide . Combat progresses through a series of rounds, each of which may be won or lost . Each round, a limited resource(`luck’) may be spent on a gamble to amplify the benefit from a win or mitigatethe deficit from a loss .…

## APAC Net Alternating the Population and Agent Control via Two Neural Networks to Solve High Dimensional Stochastic Mean Field Games

APAC-Net is an alternating population and agent control neuralnetwork for solving stochastic mean field games (MFGs) Our algorithm is gearedtoward high-dimensional instances of MFGs that are beyond reach with existingsolution methods . We show the potential of our method on up to 100-dimensional MFG problems, we show potential of the algorithm on up-to-100-dimensional problems .…