16,210 research outputs found
Market Equilibrium with Transaction Costs
Identical products being sold at different prices in different locations is a
common phenomenon. Price differences might occur due to various reasons such as
shipping costs, trade restrictions and price discrimination. To model such
scenarios, we supplement the classical Fisher model of a market by introducing
{\em transaction costs}. For every buyer and every good , there is a
transaction cost of \cij; if the price of good is , then the cost to
the buyer {\em per unit} of is p_j + \cij. This allows the same good
to be sold at different (effective) prices to different buyers.
We provide a combinatorial algorithm that computes -approximate
equilibrium prices and allocations in
operations -
where is the number goods, is the number of buyers and is the sum
of the budgets of all the buyers
Oscillatory Tunnel Splittings in Spin Systems: A Discrete Wentzel-Kramers-Brillouin Approach
Certain spin Hamiltonians that give rise to tunnel splittings that are viewed
in terms of interfering instanton trajectories, are restudied using a discrete
WKB method, that is more elementary, and also yields wavefunctions and
preexponential factors for the splittings. A novel turning point inside the
classically forbidden region is analysed, and a general formula is obtained for
the splittings. The result is appled to the \Fe8 system. A previous result for
the oscillation of the ground state splitting with external magnetic field is
extended to higher levels.Comment: RevTex, one ps figur
Private Outsourcing of Polynomial Evaluation and Matrix Multiplication using Multilinear Maps
{\em Verifiable computation} (VC) allows a computationally weak client to
outsource the evaluation of a function on many inputs to a powerful but
untrusted server. The client invests a large amount of off-line computation and
gives an encoding of its function to the server. The server returns both an
evaluation of the function on the client's input and a proof such that the
client can verify the evaluation using substantially less effort than doing the
evaluation on its own. We consider how to privately outsource computations
using {\em privacy preserving} VC schemes whose executions reveal no
information on the client's input or function to the server. We construct VC
schemes with {\em input privacy} for univariate polynomial evaluation and
matrix multiplication and then extend them such that the {\em function privacy}
is also achieved. Our tool is the recently developed {mutilinear maps}. The
proposed VC schemes can be used in outsourcing {private information retrieval
(PIR)}.Comment: 23 pages, A preliminary version appears in the 12th International
Conference on Cryptology and Network Security (CANS 2013
Electronic structure of PrCaMnO near the Fermi level studied by ultraviolet photoelectron and x-ray absorption spectroscopy
We have investigated the temperature-dependent changes in the near-
occupied and unoccupied states of PrCaMnO which shows the
presence of ferromagnetic and antiferromagnetic phases. The
temperature-dependent changes in the charge and orbital degrees of freedom and
associated changes in the Mn 3 - O 2 hybridization result in varied O
2 contributions to the valence band. A quantitative estimate of the charge
transfer energy () shows a larger value compared to the earlier
reported estimates. The charge localization causing the large is
discussed in terms of different models including the electronic phase
separation.Comment: 19 pages, 7 figures, To be published in Phy. Rev.
Nash equilibria in fisher market
Much work has been done on the computation of market equilibria. However due to strategic play by buyers, it is not clear whether these are actually observed in the market. Motivated by the observation that a buyer may derive a better payoff by feigning a different utility function and thereby manipulating the Fisher market equilibrium, we formulate the Fisher market game in which buyers strategize by posing different utility functions. We show that existence of a conflict-free allocation is a necessary condition for the Nash equilibria (NE) and also sufficient for the symmetric NE in this game. There are many NE with very different payoffs, and the Fisher equilibrium payoff is captured at a symmetric NE. We provide a complete polyhedral characterization of all the NE for the two-buyer market game. Surprisingly, all the NE of this game turn out to be symmetric and the corresponding payoffs constitute a piecewise linear concave curve. We also study the correlated equilibria of this game and show that third-party mediation does not help to achieve a better payoff than NE payoffs
Spatial Interpolants
We propose Splinter, a new technique for proving properties of
heap-manipulating programs that marries (1) a new separation logic-based
analysis for heap reasoning with (2) an interpolation-based technique for
refining heap-shape invariants with data invariants. Splinter is property
directed, precise, and produces counterexample traces when a property does not
hold. Using the novel notion of spatial interpolants modulo theories, Splinter
can infer complex invariants over general recursive predicates, e.g., of the
form all elements in a linked list are even or a binary tree is sorted.
Furthermore, we treat interpolation as a black box, which gives us the freedom
to encode data manipulation in any suitable theory for a given program (e.g.,
bit vectors, arrays, or linear arithmetic), so that our technique immediately
benefits from any future advances in SMT solving and interpolation.Comment: Short version published in ESOP 201
Quantum Lightning Never Strikes the Same State Twice
Public key quantum money can be seen as a version of the quantum no-cloning
theorem that holds even when the quantum states can be verified by the
adversary. In this work, investigate quantum lightning, a formalization of
"collision-free quantum money" defined by Lutomirski et al. [ICS'10], where
no-cloning holds even when the adversary herself generates the quantum state to
be cloned. We then study quantum money and quantum lightning, showing the
following results:
- We demonstrate the usefulness of quantum lightning by showing several
potential applications, such as generating random strings with a proof of
entropy, to completely decentralized cryptocurrency without a block-chain,
where transactions is instant and local.
- We give win-win results for quantum money/lightning, showing that either
signatures/hash functions/commitment schemes meet very strong recently proposed
notions of security, or they yield quantum money or lightning.
- We construct quantum lightning under the assumed multi-collision resistance
of random degree-2 systems of polynomials.
- We show that instantiating the quantum money scheme of Aaronson and
Christiano [STOC'12] with indistinguishability obfuscation that is secure
against quantum computers yields a secure quantum money schem
Magnetic Field Dependence of Macroscopic Quantum Tunneling and Coherence of Ferromagnetic Particle
We calculate the quantum tunneling rate of a ferromagnetic particle of diameter in a magnetic field of arbitrary angle. We consider the
magnetocrystalline anisotropy with the biaxial symmetry and that with the
tetragonal symmetry. Using the spin-coherent-state path integral, we obtain
approximate analytic formulas of the tunneling rates in the small -limit for the magnetic field normal to the easy axis (), for the field opposite to the initial easy axis (),
and for the field at an angle between these two orientations (). In addition, we obtain numerically the tunneling rates for
the biaxial symmetry in the full range of the angle of the magnetic
field (), for the values of \epsilon =0.01 and
0.001.Comment: 25 pages of text (RevTex) and 4 figures (PostScript files), to be
published in Phys. Rev.
- …